PA of Algorithms Q118
0. Match the pairs in the following:
| List-I | List-II | ||
| A. | Straseen's matrix multiplication algorithm | P. | Greedymethod |
| B. | Kruskal's minimum spanning tree algorithm | Q. | Dynamic programming |
| C. | Biconnected components algorithm | R. | Divide and Conquer |
| D. | Floyd's shortest path algorithm | S. | Depth first search |
You must be logged in to post a comment.