Match the following: (P) Prim’s algorithm for minimum spanning tree (i)…
GATE · 2015 · CS · Set 1 · Computer Science & IT
Match the following:
(P) Prim’s algorithm for minimum spanning tree | (i) Backtracking |
(Q) Floyd-Warshall algorithm for all pairs shortest paths | (ii) Greedy method |
(R) Mergesort | (iii) Dynamic programming |
(S) Hamiltonian circuit | (iv) Divide and conquer |
- A.
P-iii, Q-ii, R-iv, S-i
- B.
P-i, Q-ii, R-iv, S-iii
- C.
P-ii, Q-iii, R-iv, S-i
- D.
P-ii, Q-i, R-iii, S-iv
Attempted by 474 students.
Sign up free to check your answer
Sign up freeLoading lesson…