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

The correct matching for the following pairs is

  1. All pairs shortest path
  1. Greedy
  1. Quick Sort
  1. Depth-First Search
  1. Minimum weight spanning tree
  1. Dynamic Programming
  1. Connected Components
  1. Divide and Conquer
  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.6k points)
edited by | 1k views
+10
answer B
+1

General method for All pairs shortest path

Shortcut method 

0

Quick Sort 

Its analysis

+1

Minimum weight spanning tree 

+1

Connected Components

0
request to admin

delete this type of vedios unnecessarly increasing acrolling

3 Answers

+9 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.4k 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 (3.9k points)
0 votes
A-3

B-4

C-1

D-2
answered by (211 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

42,612 questions
48,608 answers
155,789 comments
63,784 users