MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Chans Algorithm Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Chan s algorithm can be used to compute the lower envelope of a trapezoid. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
Which of the following factors account more to the cost of Chan s algorithm? |
| A. | computing a single convex hull |
| B. | locating points that constitute a hull |
| C. | computing convex hull in groups |
| D. | merging convex hulls |
| Answer» D. merging convex hulls | |
| 3. |
Which of the following statements is not a part of Chan s algorithm? |
| A. | eliminate points not in the hull |
| B. | recompute convex hull from scratch |
| C. | merge previously calculated convex hull |
| D. | reuse convex hull from the previous iteration |
| Answer» C. merge previously calculated convex hull | |
| 4. |
Which of the following is called the ultimate planar convex hull algorithm ? |
| A. | Chan s algorithm |
| B. | Kirkpatrick-Seidel algorithm |
| C. | Gift wrapping algorithm |
| D. | Jarvis algorithm |
| Answer» C. Gift wrapping algorithm | |
| 5. |
The running time of Chan s algorithm is obtained from combining two algorithms. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
Who formulated Chan s algorithm? |
| A. | Timothy |
| B. | Kirkpatrick |
| C. | Frank Nielsen |
| D. | Seidel |
| Answer» B. Kirkpatrick | |
| 7. |
What is the running time of Chan s algorithm? |
| A. | O(log n) |
| B. | O(n log n) |
| C. | O(n log h) |
| D. | O(log h) |
| Answer» D. O(log h) | |
| 8. |
Chan s algorithm is used for computing _________ |
| A. | Closest distance between two points |
| B. | Convex hull |
| C. | Area of a polygon |
| D. | Shortest path between two points |
| Answer» C. Area of a polygon | |