Question 31 : The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 32 : Which approach is based on computing the distance between each pair of distinct points and finding a pair with the smallest distance?
1. Brute force
2. Exhaustive search
3. Divide and conquer
4. Branch and bound
View Answer   Discuss with Members

Question 33 : What is the worst case complexity of quick hull?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(log N)
View Answer   Discuss with Members

Question 34 : What is the basic operation of closest pair algorithm using brute force technique?
1. Euclidean distance
2. Radius
3. Area
4. Manhattan distance
View Answer   Discuss with Members

Question 35 : What is the runtime efficiency of using brute force technique for the closest pair problem?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(N³ log N)
View Answer   Discuss with Members

Question 36 : The running time of Chan's algorithm is obtained from combining two algorithms.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 37 : Which of the following is similar to Euclidean distance?
1. Manhattan distance
2. Pythagoras metric
3. Chebyshev distance
4. Heuristic distance
View Answer   Discuss with Members

Question 38 : The quick hull algorithm runs faster if the input uses non- extreme points.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 39 : The most important condition for which closest pair is calculated for the points (p_i, p_j) is?
1. i>j
2. i!=j
3. i=j
4. i<j
View Answer   Discuss with Members

Question 40 : What is the running time of Chan's algorithm?
1. O(log n)
2. O(n log n)
3. O(n log h)
4. O(log h)
View Answer   Discuss with Members