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

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

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

Question 4 : Which of the following statement is not related to quickhull algorithm?
1. finding points with minimum and maximum coordinates
2. dividing the subset of points by a line
3. eliminating points within a formed triangle
4. finding the shortest distance between two points
5.
View Answer   Discuss with Members

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

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

Question 7 : How many approaches can be applied to solve quick hull problem?
1. 1
2. 2
3. 3
4. 4
5.
View Answer   Discuss with Members

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

Question 9 : ___________ is a method of constructing a smallest polygon out of n given points.
1. closest pair problem
2. quick hull problem
3. path compression
4. union-by-rank
5.
View Answer   Discuss with Members

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