Question 11 : In divide and conquer, the time is taken for merging the subproblems is?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(log N)
View Answer   Discuss with Members

Question 12 : What is the optimal time required for solving the closest pair problem using divide and conquer approach?
1. O(N)
2. O(log N)
3. O(N log N)
4. O(N²)
5.
View Answer   Discuss with Members

Question 13 : Manhattan distance is an alternative way to define a distance between two points.
1. true
2. false
3.
4.
5.
View Answer   Discuss with Members

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

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

Question 16 : 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 17 : 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)
5.
View Answer   Discuss with Members

Question 18 : 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
5.
View Answer   Discuss with Members

Question 19 : Which of the following areas do closest pair problem arise?
1. computational geometry
2. graph colouring problems
3. numerical problems
4. string matching
5.
View Answer   Discuss with Members

Question 20 : In divide and conquer, the time is taken for merging the subproblems is?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(log N)
View Answer   Discuss with Members