Algorithms Quiz | Sudo Placement [1.5] | Question 6
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
Explanation: Refer : https://www.geeksforgeeks.org/algorithms-dynamic-programming-question-1/
Quiz of this Question