3,364 views

Which of the following standard algorithms is not Dynamic Programming based?

1. Bellman-Ford Algorithm for single source shortest path
2. Floyd Warshall Algorithm for all pairs shortest paths
3. $0-1$ Knapsack problem
4. Prim’s Minimum Spanning Tree

Prim's MST is greedy algorithm. Rest are standard dynamic programming algorithm.

So D is correct.
by
Option D) Prims Algorithm , which is a greedy algorithm.
by
D IS GREEDY APPROACH PRIMS  ALGO
by