## Buy/Download all MCQ Ebook
>>>**Click Here**<<<

## Quickhull Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

Question 1 |

..... is a method of constructing a smallest polygon out of n given points.

closest pair problem | |

quick hull problem | |

path compression | |

union-by-rank |

Question 1 Explanation:

Quick hull is a method of constructing a smallest convex polygon out of n given points in a plane.

Question 2 |

What is the other name for quick hull problem?

convex hull | |

concave hull | |

closest pair | |

path compression |

Question 2 Explanation:

The other name for quick hull problem is convex hull problem whereas the closest pair problem is the problem of finding the closest distance between two points.

Question 3 |

How many approaches can be applied to solve quick hull problem?

1 | |

2 | |

3 | |

4 |

Question 3 Explanation:

Most commonly, two approaches are adopted to solve quick hull problem- brute force approach and divide and conquer approach.

Question 4 |

What is the average case complexity of a quick hull algorithm?

O(N) | |

O(N log N) | |

O(N ^{2}) | |

O(log N) |

Question 4 Explanation:

The average case complexity of quickhull algorithm using divide and conquer approach is mathematically found to be O(N log N).

Question 5 |

What is the worst case complexity of quick hull?

O(N) | |

O(N log N) | |

O(N ^{2}) | |

O(log N) |

Question 5 Explanation:

The worst case complexity of quickhull algorithm using divide and conquer approach is mathematically found to be O(N

^{2}).
There are 5 questions to complete.