GATE CS 2017 (Forenoon) — Question 26

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

Let \(G = (V, E)\) be any connected undirected edge-weighted graph. The weights of the edges in \(E\) are positive and distinct. Consider the following statements: I. Minimum Spanning Tree of \(G\) is always unique. II. Shortest path between any two vertices of \(G\) is always unique. Which of the above statements is/are necessarily true?
  1. A
    I only
  2. B
    II only
  3. C
    Both I and II
  4. D
    Neither I nor II
Practise the full 2017-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