Question 1186 – Nielit Scientist-B CS 22-07-2017
December 3, 2023Question 957 – Nielit Scientist-B IT 4-12-2016
December 3, 2023Question 1185 – Nielit Scientist-B CS 22-07-2017
Which of the following standard algorithms is not Dynamic Programming based?
Correct Answer: D
Question 38 Explanation:
Prim’s minimum spanning tree is following greedy technique.
Bellman ford algorithm for single source shortest path
floyd Warshall for all pairs shortest paths
0-1 knapsack problem
Prim’s minimum spanning tree
Subscribe
Login
0 Comments