GATE CS 2008 – Question 31

Multiple choice 2 marks Question 31 2008

Question 31

MCQ 2 marks · −0.66 Algorithms

The most efficient algorithm for finding the number of connected components in an undirected graph on \(n\) vertices and \(m\) edges has time complexity

A \(\Theta(n)\) B \(\Theta(m)\) C \(\Theta(m + n)\) D \(\Theta(mn)\)

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2008 Algorithms

Source: GATE 2008 Computer Science and Engineering, Q31 (question number approximate)

GATE CS 2021 Set 1 – Question 36
GATE CS 2019 – Question 37
GATE CS 2018 – Question 14
GATE CS 2017 Set 1 – Question 39
GATE CS 2016 Set 2 – Question 36
GATE CS 2016 Set 1 – Question 12
GATE CS 2015 Set 2 – Question 14
GATE CS 2015 Set 1 – Question 34

All Algorithms questions

The answer and the full explanation are one sign-in away

Where this question comes from

More questions from Algorithms