Match the following:P) Prim’s algorithm for minimum spanning tree (i) BacktrackingQ) Floyd-Warshall algorithm for all pairs shortest paths (ii) Greedy methodR) Mergesort (iii) Dynamic programmingS) Hamiltonian circuit (iv) Divide and conquer

Question

Match the following:P) Prim’s algorithm for minimum spanning tree                       (i) BacktrackingQ) Floyd-Warshall algorithm for all pairs shortest paths          (ii) Greedy methodR) Mergesort                                                                           (iii) Dynamic programmingS) Hamiltonian circuit                                                               (iv) Divide and conquer

Examsnet · Accepted Answer

Correct Answer is : P – ii, Q – iii, R – iv, S – i

GATE Computer Science (CS) 2015 Shift 1 Solved Paper