![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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 AlgorithmsNo comments yet