(A) True
(B) False
(C) NA
(D) NA
Brute-force algorithm is defined as ,It is a very general problemsolving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem’s statement?
(A) True
(B) False
(C) NA
(D) NA
Given a set of n points, P = {p1, p2, . . . , pn} in 2-space a point is said to be __ if it is not dominated by any other point in P.
(A) maximal
(B) mininal
(C) average
(D) none
A point p is not said to be dominated by point q if q.x ≤ p.x and q.y ≤ p.y?
(A) True
(B) False
(C) NA
(D) NA
A point p in 2-dimensional space be given by its integer coordinates, p = (p.x, p.y)?
(A) True
(B) False
(C) NA
(D) NA
We assume that in RAM machine , each basic operation takes the __ constant time to execut.
(A) same
(B) different
(C) constant
(D) none
IP datagram can contains __ octets.
(A) 0-65,535
(B) 1-65,535
(C) 1-65,536
(D) none of the given
__field tells the receiver how to order fragments within a given datagram.
(A) FLAGS
(B) FLAGMENT OFFSET
(C) IDENTIFICATION
(D) None of the given