Question 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.
A
Bellman ford algorithm for single source shortest path
B
floyd Warshall for all pairs shortest paths
C
0-1 knapsack problem
D
Prim’s minimum spanning tree
mohitkr403@gmail.com

Leave a Reply

Your email address will not be published. Required fields are marked *

error: <b>Alert: </b>Content selection is disabled!!
Question 1186 – Nielit Scientist-B CS 22-07-2017
December 3, 2023
Question 957 – Nielit Scientist-B IT 4-12-2016
December 3, 2023
Question 1186 – Nielit Scientist-B CS 22-07-2017
December 3, 2023
Question 957 – Nielit Scientist-B IT 4-12-2016
December 3, 2023