794 views
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (b) & \text{Kruskal's minimum spanning tree algorithm} & (q) & \text{Dynamic programming} \\\hline (c) & \text{Biconnected components algorithm} & (r) & \text{Divide and Conquer} \\\hline (d) & \text{Floyd's shortest path algorithm} & (s) &\text{Depth-first search} \\\hline \end{array}$$

edited | 794 views

$(a)$ Strassen's matrix multiplication algorithm -  $(r)$ Divide and Conquer

$(b)$ Kruskal's minimum spanning tree algorithm - $(p)$ Greedy method

$(c)$ Biconnected components algorithm - $(s)$ Depth first search

$(d)$ Floyd's shortest path algorithm - $(q)$ Dynamic programming

$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (r) & \text{Divide and Conquer} \\\hline (b) & \text{Kruskal's minimum spanning tree algorithm} & (p) & \text{Greedy method} \\\hline (c) & \text{ Biconnected components algorithm} & (s) & \text{Depth-first search} \\\hline (d) & \text{Floyd's shortest path algorithm} & (q) & \text{Dynamic programming} \\\hline \end{array}$$
by Active (2.4k points)
edited