GATE CS 2021 (Forenoon) — Question 27

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT1 markHard

Consider the following undirected graph with edge weights as shown:
Question image
The number of minimum-weight spanning trees of the graph is _________.
Practise the full 2021-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Minimum Spanning Trees (Prim/Kruskal Algorithms)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group