42Dijkstra’s Algorithm is the prime example for ___________
A. Greedy algorithm
B. Branch and bound
C. Back tracking
D. Dynamic programming
Answer:A
42Dijkstra’s Algorithm is the prime example for ___________
A. Greedy algorithm B. Branch and bound C. Back tracking D. Dynamic programming
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.