Algorithms | Dynamic Programming | Question 7

Which of the following standard algorithms is not Dynamic Programming based.
(A) Bellman–Ford Algorithm for single source shortest path
(B) Floyd Warshall Algorithm for all pairs shortest paths
(C) 0-1 Knapsack problem
(D) Prim’s Minimum Spanning Tree


Answer: (D)

Explanation: Prim’s Minimum Spanning Tree is a Greedy Algorithm. All other are dynamic programming based.

Quiz of this Question

My Personal Notes arrow_drop_up

Save