The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+17 votes
1.2k views

The correct matching for the following pairs is

$$\begin{array}{l|l}\hline \text{A. All pairs shortest path}  &  \text{1. Greedy } \\\hline  \text{B. Quick Sort} & \text{2. Depth-First Search} \\\hline  \text{C. Minimum weight spanning tree} & \text{3. Dynamic Programming} \\\hline  \text{D. Connected Components} & \text{4. 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}$

asked in Algorithms by Veteran (59.8k points)
edited by | 1.2k views
+10
answer B

3 Answers

+10 votes
Best answer
Answer : B) A-3 B-4 C-1 D-2
(A) All pairs shortest path (3) Dynamic Programming
(B) Quick Sort (4) Divide and Conquer
(C) Minimum weight spanning tree (1) Greedy
(D) Connected Components (2) Depth-First Search

Reference :  Read the Intro/Algo Sub-Heading.

answered by Active (1.6k points)
edited by
0
We can find  MST using BFS /greedy not DFS but yes we can find connected components using DFS
0
please explain the concept of " connected component" ..?
+1 vote
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"
answered by Active (4.5k points)
0 votes
A-3

B-4

C-1

D-2
answered by (209 points)
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,129 questions
53,252 answers
184,785 comments
70,506 users