Register

UGC NET CSE | June 2019 | Part 2 | Question: 61

• edited by
2,389 views
2 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)

2 Answers

0 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

 

Voting & Accepting an answer helps improve the community
Answer:
← Previous · UGC NET CSE | June 2...Next → · UGC NET CSE | June 2...
← Previous in category · UGC NET CSE | June 2...Next in category → · KPGCET-CSE-2019-66
Position:
Show:

Related questions

3 3 votes
2 2 answers
4.2k
4.2k views
Arjun asked Jul 2, 2019
4,193 views
UGC NET CSE | June 2019 | Part 2 | Question: 62
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n \text{lg}n)$. Like $P$, but unlike $Q$, heapsort sorts in place wher...
8 8 votes
3 3 answers
4.8k
4.8k views
Arjun asked Jul 2, 2019
4,762 views
UGC NET CSE | June 2019 | Part 2 | Question: 64
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)$
5 5 votes
1 1 answer
2.5k
2.5k views
Arjun asked Jul 2, 2019
2,503 views
UGC NET CSE | June 2019 | Part 2 | Question: 65
Which of the following is application of depth-first search?Only topological sortOnly strongly connected componentsBoth topological sort and strongly connected components...
3 3 votes
2 2 answers
5.5k
5.5k views
Arjun asked Jul 2, 2019
5,521 views
UGC NET CSE | June 2019 | Part 2 | Question: 66
Consider double hashing of the form$h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m-1$ and $m=701$....