GATE CSE · Free quiz
No signup needed. Answer 5 real GATE CSE questions, get instant scoring and solutions, then unlock full mocks and your weak-topic map for free.
Question 1 of 5
HARDConsider a weighted undirected graph with 6 vertices and 9 edges. Kruskal's algorithm is applied to find the minimum spanning tree. If the edge weights are distinct, what is the maximum number of edges that will be examined before the MST is complete?