M

Mr. Dubey • 52.30K Points
Coach 

Q. Which of the following algorithms is the simplest?

(A) chan’s algorithm
(B) kirkpatrick-seidel algorithm
(C) gift wrapping algorithm
(D) jarvis algorithm
Correct : Option (A)

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.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Algebra of logic is termed as

Q. Software process models are

Q. Quicksort's performance is greatly affected by the way it partitions a sequence.

Q. Which of these steps can create conflict among the processors?

Q. The Internet Control Message Protocol (ICMP)

Q. The name of the system database that contains descriptions of data in the database is

Q. TQM & ISO both focuses on

Q. The following is the C++ style comment

Q. Which of the following pair of regular

Q. In DTL logic gating function is performed by