McqMate

Q. |
## 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» B. recompute convex hull from scratch | |

Explanation: chan’s algorithm implies that the convex hulls of larger points can be arrived at by merging previously calculated convex hulls. it makes the algorithm simpler instead of recomputing every time from scratch. |

1.7k

0

Do you find this helpful?

15

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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 algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Prim’s algorithm resembles Dijkstra’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.