0 votes 0 votes Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree Algorithms nielit2017july-scientistb-cs algorithms easy dynamic-programming + – admin asked Mar 30, 2020 retagged Jan 10 by Hira Thakur admin 6.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Prim's MST is greedy algorithm. Rest are standard dynamic programming algorithm. So D is correct. smsubham answered Apr 3, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option D) Prims Algorithm , which is a greedy algorithm. Sanandan answered Sep 11, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes D IS GREEDY APPROACH PRIMS ALGO lovegate answered Mar 9, 2021 lovegate comment Share Follow See all 0 reply Please log in or register to add a comment.