Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Which of the following statements are false ?
(P) : Prims method always maintain tree structure at every level.
(Q) : Both Prim’s and Kruskal’s generate the same MST for all kind of graphs.
(R) : Kruskal’s method maintains connectivity at each level whereas Prim’s method may not.
(S) : Time complexity of Prim’s method is O (e log e) whereas the time complexity of Kruskal’s method is O(n2)
(T) : Spanning tree has a wide application in network routing.
1
P, Q, T
2
Q,R,S
3
R, S, T
4
all of P, Q, R,S, T