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 (3) Dynamic programming
spanning tree
(D) Connected Components (4) Divide and conquer
| A. | A-2 , B-4 , C-1, D-3 |
| B. | A-3 , B-4 , C-l , D-2 |
| C. | A-3 , B-4 , C-2 , D-1 |
| D. | A-4 , B-1 , C-2 , D-3 |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
