Top MCQs on Minimum Spanning Tree (MST) in Graphs with Answers

Question 21

If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ?

• O(m logn)
• O(n)
• O(m)
• O(n logm)

Question 22

Consider a graph G=(V, E), where V = { v1,v2,…,v100 }, E={ (vi, vj) ∣ 1≤ i < j ≤ 100} and weight of the edge (vi, vj)  is ∣i–j∣. The weight of minimum spanning tree of G is ________. Note - This question was Numerical Type.

• 99

• 100

• 98

• 101