retagged by
4,977 views
21 votes
21 votes

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.} & \text{Quick Sort} & \text{2.}& \text{Depth-First Search} \\\hline   \text{C.}& \text{Minimum weight spanning tree} & \text{3.}  & \text{Dynamic Programming} \\\hline  \text{D.} & \text{Connected Components} &\text{4.}  & \text{Divide and Conquer}  \\\hline \end{array}$$

  1. $\text{A-2 B-4 C-1 D-3}$

  2. $\text{A-3 B-4 C-1 D-2}$

  3. $\text{A-3 B-4 C-2 D-1}$

  4. $\text{A-4 B-1 C-2 D-3}$

retagged by

3 Answers

Best answer
22 votes
22 votes
Answer : (B) A-3 B-4 C-1 D-2$$\begin{array}{|ll|ll|}\hline \text{A.} & \text{All pairs shortest path} & \text{3.} & \text{Dynamic Programming} \\\hline  \text{B.} & \text{Quick Sort} & \text{2.}& \text{Divide and Conquer} \\\hline   \text{C.}& \text{Minimum weight spanning tree} & \text{1.}  & \text{Greedy} \\\hline  \text{D.} & \text{Connected Components} &\text{2.}  & \text{Depth-First Search}  \\\hline \end{array}$$

Reference: Read the Intro/Algo Sub-Heading.

1 votes
1 votes
1- All pair shortest path ------> dynamic programing

2-quick sort --------> divide and conquer

3-MST ----------->Greedy technique

4- connected component ------>Depth-First search

 

*Answer will be "b"
Answer:

Related questions

25 votes
25 votes
7 answers
1
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} \...
11 votes
11 votes
1 answer
2
makhdoom ghaya asked Nov 19, 2016
5,833 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 (...
25 votes
25 votes
3 answers
3
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...
26 votes
26 votes
4 answers
4
makhdoom ghaya asked Feb 12, 2015
5,514 views
Match the following:$$\begin{array}{|ll|ll|}\hline \text{P.} & \text{Prim's algorithm for minimum spanning tree} & \text{i.} & \text{Backtracking} \\\hline \text{Q.}...