The Gateway to Computer Science Excellence

+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:

- (a) – (ii); (b)-(iv); (c)-(i); (d)-(iii)
- (a) – (iii); (b)-(iv); (c)-(i); (d)-(ii)
- (a) – (ii); (b)-(i); (c)-(iv); (d)-(iii)
- (a) – (iii); (b)-(i); (c)-(iv); (d)-(ii)

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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,647 questions

56,492 answers

195,439 comments

100,710 users