Top 150+ Solved Design and Analysis of Algorithms MCQ Questions Answer
Q. Which of the following areas do closest pair problem arise?
a. computational geometry
b. graph colouring problems
c. numerical problems
d. string matching
Q. What is the runtime efficiency of using brute force technique for the closest pair problem?
a. o(n)
b. o(n log n)
c. o(n2)
d. o(n3 log n)
Q. The most important condition for which closest pair is calculated for the points (pi, pj) is?
a. i>j
b. i!=j
c. i=j
d. i<j
Q. What is the basic operation of closest pair algorithm using brute force technique?
a. euclidean distance
b. radius
c. area
d. manhattan distance
Q. Which of the following is similar to Euclidean distance?
a. manhattan distance
b. pythagoras metric
c. chebyshev distance
d. heuristic distance
Q. Which of the following strategies does the following diagram depict?
a. divide and conquer strategy
b. brute force
c. exhaustive search
d. backtracking
Q. What is the optimal time required for solving the closest pair problem using divide and conquer approach?
a. o(n)
b. o(log n)
c. o(n log n)
d. o(n2)
Q. In divide and conquer, the time is taken for merging the subproblems is?
a. o(n)
b. o(n log n)
c. o(n2)
d. o(log n)
Q. Which of the following strategies does the following diagram depict?
a. brute force
b. divide and conquer
c. exhaustive search
d. branch and bound
Q. Which of the points are closer to each other?
a. p1 and p11
b. p3 and p8
c. p2 and p3
d. p9 and p10
Q. Cross product is a mathematical operation performed between
a. 2 scalar numbers
b. a scalar and a vector
c. 2 vectors
d. any 2 numbers
Q. Cross product is also known as?
a. scalar product
b. vector product
c. dot product
d. multiplication