retagged by
5,833 views
11 votes
11 votes
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}$$
retagged by

1 Answer

Best answer
23 votes
23 votes
$(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}$$
edited by

Related questions

25 votes
25 votes
3 answers
2
go_editor asked Feb 12, 2015
6,931 views
Given below are some algorithms, and some algorithm design paradigms.$$\begin{array}{ll|ll}\hline \text{1.} & \text{Dijkstra's Shortest Path} & \text{i.} & \text{Divide a...
25 votes
25 votes
7 answers
3
khushtak asked Feb 14, 2017
6,941 views
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
21 votes
21 votes
3 answers
4
Kathleen asked Sep 29, 2014
4,976 views
The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...