GRE Computer Science Question 12
12. Two classical algorithms for finding a minimum spanning tree in a graph are Kruskal's algorithm
and Prim's algorithm. Which of the following are the design paradigms used by these algorithms?
Kruskal's algorithm Prim's algorithm
(A) The greedy method The greedy method
(B) The greedy method Dynamic programming
(C) Dynamic programming The greedy method
(D) Dynamic programming Divide and conquer
(E) Divide and conquer Dynamic programming
