1k views

The correct matching for the following pairs is

 All pairs shortest path Greedy Quick Sort Depth-First Search Minimum weight spanning tree Dynamic Programming Connected Components 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}$

edited | 1k views
+10
+1

General method for All pairs shortest path

Shortcut method

0

Quick Sort

Its analysis

+1

Minimum weight spanning tree

+1

Connected Components

0

delete this type of vedios unnecessarly increasing acrolling

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

edited
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

A-3

B-4

C-1

D-2

1
2