in Algorithms retagged by
3,364 views
0 votes
0 votes

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
in Algorithms retagged by
3.4k views

3 Answers

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

So D is correct.
0 votes
0 votes
Option D) Prims Algorithm , which is a greedy algorithm.
0 votes
0 votes
D IS GREEDY APPROACH PRIMS  ALGO
Answer:

Related questions