Chan’s Algorithm Quiz Online Practice Test

1. Chan’s algorithm is employed for calculating _________

Closest distance between two points

Convex hull

Area of a polygon

Shortest path between two points

2. What is the time complexity of Chan’s algorithm?

O(log n)

O(n log n)

O(n log h)

O(log h)

3. Who developed Chan’s algorithm?

Timothy

Kirkpatrick

Frank Nielsen

Seidel

4. The time complexity of Chan’s algorithm is derived from combining two different algorithms.

True

False

Only one algorithm is used

It is based on a new approach

5. Which algorithm is referred to as the “ultimate planar convex hull algorithm”?

Chan’s algorithm

Kirkpatrick-Seidel algorithm

Gift wrapping algorithm

Jarvis algorithm

6. Which algorithm is known for its simplicity?

Chan’s algorithm

Kirkpatrick-Seidel algorithm

Gift wrapping algorithm

Jarvis algorithm

7. What is the time complexity of the Hershberger algorithm?

O(log n)

O(n log n)

O(n log h)

O(log h)

8. Which statement does not pertain to Chan’s algorithm?

Eliminate points not on the hull

Recompute the convex hull from scratch

Merge previously calculated convex hulls

Reuse the convex hull from the previous iteration

9. Which factor contributes most to the cost of Chan’s algorithm?

Computing a single convex hull

Identifying the points that form the hull

Computing convex hulls in groups

Merging convex hulls

10. Chan’s algorithm can be used to compute the lower envelope of a trapezoid.

True

False

Only for convex envelopes

Only for higher dimensions

Test Name:	Chan’s Algorithm Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	10 / 10
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Chan’s Algorithm MCQ Quiz Online Practice Test