The Gateway to Computer Science Excellence
+2 votes
347 views

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)
in Algorithms by
edited by | 347 views

3 Answers

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

 

by
0 votes
Answer is option B
by
0 votes

Option (B)

Prim’s algorithm→ O(ElogV)
Dijsktra’s algorithm → O($V^2$​ )
Faster all-pair shortest path→ O($V^3$​ logV)
Edmonds-karp algorithm → O( V $E^2$​ )

by

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
52,315 questions
60,436 answers
201,775 comments
95,253 users