- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following factors account m...

Q. |
## Which of the following factors account more to the cost of Chan’s algorithm? |

A. | computing a single convex hull |

B. | locating points that constitute a hull |

C. | computing convex hull in groups |

D. | merging convex hulls |

Answer» C. computing convex hull in groups | |

Explanation: the majority of the cost of the algorithm lies in the pre-processing (i.e.) computing convex hull in groups. to reduce cost, we reuse convex hulls from previous iterations. |

View all MCQs in:
Design and Analysis of Algorithms

- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.
- 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.

Login to Continue

It will take less than 2 minutes

Report MCQ