GATE 2011
January 3, 2025Algorithms
January 3, 2025Algorithms
| Question 40 |
The correct matching for the following pairs is
(A) All pairs shortest path (1) Greedy (B) Quick Sort (2) Depth-First search (C) Minimum weight spanning tree (3) Dynamic Programming (D) Connected Components (4) Divide and and Conquer
| A – 2 B – 4 C – 1 D – 3 | |
| A – 3 B – 4 C – 1 D – 2 | |
| A – 3 B – 4 C – 2 D – 1 | |
| A – 4 B – 1 C – 2 D – 3 |
Question 40 Explanation:
All pairs shortest path – Dynamic Programming
Quick sort – Divide and Conquer
Minimum weight Spanning tree – Greedy
Connected components – Depth-First search
Quick sort – Divide and Conquer
Minimum weight Spanning tree – Greedy
Connected components – Depth-First search
Correct Answer: B
Question 40 Explanation:
All pairs shortest path – Dynamic Programming
Quick sort – Divide and Conquer
Minimum weight Spanning tree – Greedy
Connected components – Depth-First search
Quick sort – Divide and Conquer
Minimum weight Spanning tree – Greedy
Connected components – Depth-First search