# Quickhull Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 6
What does the following diagram depict?
 A closest pair B convex hull C concave hull D path compression

Question 6 Explanation:
The above diagram is a depiction of convex hull, also known as quick hull, since it encloses n points into a convex polygon.

 Question 7
Which of the following statement is not related to quickhull algorithm?
 A finding points with minimum and maximum coordinates B dividing the subset of points by a line C eliminating points within a formed triangle D finding the shortest distance between two points

Question 7 Explanation:
Finding the shortest distance between two points belongs to closest pair algorithm while the rest is quickhull.

 Question 8
The quick hull algorithm runs faster if the input uses non- extreme points.
 A true B false

Question 8 Explanation:
It is proved that the quick hull algorithm runs faster if the input uses non-extreme points and also, if it uses less memory.

 Question 9
To which type of problems does quick hull belong to?
 A numerical problems B computational geometry C graph problems D string problems

Question 9 Explanation:
Quick hull problem and closest pair algorithms are some of the examples of computational problems.

 Question 10
Which of the following algorithms is similar to a quickhull algorithm?
 A merge sort B shell sort C selection sort D quick sort