GATE CS 2019 (Forenoon) — Question 48

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)MCQ2 marks · −2/3 if wrongMedium

Let G be any connected, weighted, undirected graph: I. G has a unique minimum spanning tree, if no two edges of G have the same weight. II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut. Which of the above two statements is/are TRUE?
  1. A
    I only
  2. B
    II only
  3. C
    Both I and II
  4. D
    Neither I nor II
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
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