Chan’s Algorithm Multiple choice Questions and Answers (MCQs)

DOWNLOAD FREE PDF <<CLICK HERE>>

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 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
Computer science (GATE/NET) Questions answers
Question 1 Explanation: 
Chan's algorithm is an output-sensitive algorithm used to compute the convex hull set of n points in a 2D or 3D space. Closest pair algorithm is used to compute the closest distance between two points.

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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)
English grammar Questions answers
Question 2 Explanation: 
The running time of Chan's algorithm is calculated to be O(n log h) where h is the number of vertices of the convex hull.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Who formulated Chan's algorithm?
A
Timothy
B
Kirkpatrick
C
Frank Nielsen
D
Seidel
GK (GENERAL KNOWLEDGE) Questions answers
Question 3 Explanation: 
Chan's algorithm was formulated by Timothy Chan. Kirkpatrick and Seidel formulated the Kirkpatrick-Seidel algorithm. Frank Nielsen developed a paradigm relating to Chan's algorithm.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
The running time of Chan's algorithm is obtained from combining two algorithms.
A
True
B
False
GK (GENERAL KNOWLEDGE) Questions answers
Question 4 Explanation: 
The O(n log h) running time of Chan's algorithm is obtained by combining the running time of Graham's scan [O(n log n)] and Jarvis match [O(nh)].

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
Bank exam Questions answers
Question 5 Explanation: 
Kirkpatrick-Seidel algorithm is called as the ultimate planar convex hull algorithm. Its running time is the same as that of Chan's algorithm (i.e.) O(n log h).

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>