GATE CS and IT 2015 Paper
© examsnet.com
Question : 13
Total: 65
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 |
Go to Question: