GATE CS 2020 (Forenoon) — Question 41

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

Let \( G = (V, E) \) be a weighted undirected graph and let \( T \) be a Minimum Spanning Tree (MST) of \( G \) maintained using adjacency lists. Suppose a new weighted edge \( (u, v) \in V \times V \) is added to \( G \). The worst case time complexity of determining if \( T \) is still an MST of the resultant graph is
  1. A
    \( \Theta(|E| + |V|) \)
  2. B
    \( \Theta(|E||V|) \)
  3. C
    \( \Theta(|E| \log |V|) \)
  4. D
    \( \Theta(|V|) \)
Practise the full 2020-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