- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Dijkstra’s Algorithm is the prime exampl...

Q. |
## Dijkstra’s Algorithm is the prime example for |

A. | greedy algorithm |

B. | branch and bound |

C. | back tracking |

D. | dynamic programming |

Answer» A. greedy algorithm | |

Explanation: dijkstra’s algorithm is the prime example for greedy algorithms because greedy algorithms generally solve a problem in stages by doing what appears to be the best thing at each stage. |

View all MCQs in:
Design and Analysis of Algorithms

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

Login to Continue

It will take less than 2 minutes

Report MCQ