PA of Algorithms Q124
| List-I | List-II | ||
| A. | Prim's algorithm for minimum spanning tree | 1. | Backtracking |
| B. | Floyd-Warshall algorithm for all pairs shortest paths | 2. | Greedy method |
| C. | Mergesort | 3. | Dynamic programming |
| D. | Hamiltonian circuit | 4. | Divide and Conquer |
Codes:
| A | B | C | D | |
| (a) | 3 | 2 | 4 | 1 |
| (b) | 1 | 2 | 4 | 3 |
| (c) | 2 | 3 | 4 | 1 |
| (d) | 2 | 1 | 3 | 4 |
- Option : C
- Explanation : Prims algorithm is greedy method because it choose minimum distance node. Floyd warshal’s is dynamic because it changes the distance on each iteration. Merge sort is divide and conquer because it divide the whole list is sublist and combine after sorting each sublist Hamiltonian cycle is based on backtracking.
