in Algorithms edited by
144 views
0 votes
0 votes

Given below are some famous algorithms and some algorithm design paradigms

$$\begin{array} {|l|l|} \hline \qquad \qquad  \qquad \textbf{Algorithms} & \textbf{Design Paradigms} \\\hline \text{1. Dijkstra’s shortest path algorithm} & \text{(a) Greedy design} \\\hline \text{2. Floyd Warshall’s all-pair-shortest path algorithm} & \text{(b) Divide and conquer} \\\hline \text{3. Kruskal’s minimum spanning tree algorithm} & \text{(c) Dynamic programming} \\\hline \text{4. Merge Sort algorithm} & \\\hline \end{array}$$

Which of the following correspondence is correct?

  1. $\text{1-(a), 2-(c), 3-(a), 4-(b)}$
  2. $\text{1-(a), 2-(b), 3-(a), 4-(c)}$
  3. $\text{1-(a), 2-(b), 3-(c), 4-(c)}$
  4. $\text{1-(c), 2-(b), 3-(a), 4-(b)}$
in Algorithms edited by
144 views

Please log in or register to answer this question.

Answer:

Related questions