Chan's Algorithm Multiple choice Questions and Answers (MCQs)
Congratulations - you have completed Chan's Algorithm Multiple choice Questions and Answers (MCQs).
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 6 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
Which of the following algorithms is the simplest?
Gift wrapping algorithm
Question 6 Explanation:
Chan's algorithm is very practical for moderate sized problems whereas Kirkpatrick-Seidel algorithm is not. Although, they both have the same running time. Gift wrapping algorithm is a non-output sensitive algorithm and has a longer running time.
Question 7 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
What is the running time of Hershberger algorithm?
O(n log n)
O(n log h)
Question 7 Explanation:
Hershberger's algorithm is an output sensitive algorithm whose running time was originally O(n log n). He used Chan's algorithm to speed up to O(n log h) where h is the number of edges.
Question 8 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
Which of the following statements is not a part of Chan's algorithm?
eliminate points not in the hull
recompute convex hull from scratch
merge previously calculated convex hull
reuse convex hull from the previous iteration
Question 8 Explanation:
Chan's algorithm implies that the convex hulls of larger points can be arrived at by merging previously calculated convex hulls. It makes the algorithm simpler instead of recomputing every time from scratch.
Question 9 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
Which of the following factors account more to the cost of Chan's algorithm?
computing a single convex hull
locating points that constitute a hull
computing convex hull in groups
merging convex hulls
Question 9 Explanation:
The majority of the cost of the algorithm lies in the pre-processing (i.e.) computing convex hull in groups. To reduce cost, we reuse convex hulls from previous iterations.
Question 10 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
Chan's algorithm can be used to compute the lower envelope of a trapezoid.
Question 10 Explanation:
An extension of Chan's algorithm can be used for proving solutions to complex problems like computing the lower envelope L(S) where S is a set of 'n' line segments in a trapezoid.
Digital Education is a concept to renew the education system in the world. It is a program that endeavors to bridge the literacy slippage by delivering education through a digital platform to children and teachers. You can tell your friends regarding our intiative, click share button below.
There are 10 questions to complete.