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

Q. |
## Which of the following statement is not related to quickhull algorithm? |

A. | finding points with minimum and maximum coordinates |

B. | dividing the subset of points by a line |

C. | eliminating points within a formed triangle |

D. | finding the shortest distance between two points |

Answer» D. finding the shortest distance between two points | |

Explanation: finding the shortest distance between two points belongs to closest pair algorithm while the rest is quickhull. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following algorithms is similar to a quickhull 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