PA of Algorithms Q120
0. Match the pairs in the following:
| List-I | List-II | ||
| A. | All pairs shortest paths | P. | Greedy |
| B. | Quick Sort | Q. | Depth-First search |
| C. | Minimum weight spanning tree | R. | Dynamic Programming |
| D. | Connected Components | S. | Divide and Conquer |
0. Match the pairs in the following:
| List-I | List-II | ||
| A. | All pairs shortest paths | P. | Greedy |
| B. | Quick Sort | Q. | Depth-First search |
| C. | Minimum weight spanning tree | R. | Dynamic Programming |
| D. | Connected Components | S. | Divide and Conquer |
You must be logged in to post a comment.