edited by
1,633 views
2 votes
2 votes

Match List-I with List-II:

$$\begin{array}{|c|c|c|c|} \hline {} & \text{List-I} & {} & \text{List-II} \\ \hline (a) & \text{Prim’s algorithm} & (i) & O(V^3 \log V) \\ \hline (b) & \text{Dijkstra’s algorithm} & (ii) & O(VE^2) \\ \hline (c) & \text{Faster all-pairs shortest path} & (iii) & O(ElgV) \\ \hline (d) & \text{Edmonds-Karp algorithm} & (iv) & O(V^2) \\ \hline \end{array}$$

Choose the correct option from those options given below:

  1. (a) – (ii); (b)-(iv); (c)-(i); (d)-(iii)
  2. (a) – (iii); (b)-(iv); (c)-(i); (d)-(ii)
  3. (a) – (ii); (b)-(i); (c)-(iv); (d)-(iii)
  4. (a) – (iii); (b)-(i); (c)-(iv); (d)-(ii)
edited by

2 Answers

0 votes
0 votes

Right answer 2.(a)-(iii) (b)-(iv),(c)-(I),(d)-(ii)

Prims algorithm-(E logV)

Dijkstra's algorithm- (V^2)

Floyd's warshal all- shortest path algorithm-(V^3 log V)

Edmonds Karp algorithm- (VE^2)

https://en.m.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm

https://en.m.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm

https://www.cs.auckland.ac.nz/software/AlgAnim/prim.html

 

Answer:

Related questions

7 votes
7 votes
3 answers
2
Arjun asked Jul 2, 2019
3,277 views
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$?$O(\text{lg } n)$$O(n)$$O(n\text { lg }n)$$O(n^2)$
1 votes
1 votes
1 answer
3
Arjun asked Jul 2, 2019
1,851 views
Which of the following is application of depth-first search?Only topological sortOnly strongly connected componentsBoth topological sort and strongly connected components...
3 votes
3 votes
2 answers
4