GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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

asked in Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer by gate

1 Answer

0 votes
D

Prim's Minimum Spanning Tree
answered by gate

Related questions

The best answer to any question