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

Question 42 : To which type of problems does quick hull belong to?
1. numerical problems
2. computational geometry
3. graph problems
4. string problems
View Answer   Discuss with Members

Question 43 : 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²)
View Answer   Discuss with Members

Question 44 : Which of the following algorithms is similar to a quickhull algorithm?
1. merge sort
2. shell sort
3. selection sort
4. quick sort
View Answer   Discuss with Members

Question 45 : The time is taken to find the 'n' points that lie in a convex quadrilateral is?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(log N)
View Answer   Discuss with Members

Question 46 : Which of the following statements is not a part of Chan's algorithm?
1. eliminate points not in the hull
2. recompute convex hull from scratch
3. merge previously calculated convex hull
4. reuse convex hull from the previous iteration
View Answer   Discuss with Members

Question 47 : What is the other name for quick hull problem?
1. convex hull
2. concave hull
3. closest pair
4. path compression
View Answer   Discuss with Members

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

Question 49 : Which of the following algorithms is the simplest?
1. Chan's algorithm
2. Kirkpatrick-Seidel algorithm
3. Gift wrapping algorithm
4. Jarvis algorithm
View Answer   Discuss with Members

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