- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following algorithms is the...

Q. |
## Which of the following algorithms is the simplest? |

A. | chan’s algorithm |

B. | kirkpatrick-seidel algorithm |

C. | gift wrapping algorithm |

D. | jarvis algorithm |

Answer» A. chan’s algorithm | |

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. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the simplest method to prove that a graph is bipartite?
- Which of the following sorting algorithms is the fastest?
- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- Which of the following algorithms is similar to a quickhull algorithm?
- Which of the following algorithms does Stable marriage problem uses?
- The running time of Chan’s algorithm is obtained from combining two algorithms.
- is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- Which of the following strategies does the following diagram depict?
- Which of the following strategies does the following diagram depict?

Login to Continue

It will take less than 2 minutes

Report MCQ