GATE CS 2008 – Question 31
The most efficient algorithm for finding the number of connected components in an undirected graph on \(n\) vertices and \(m\) edges has time complexity
Subject-wise GATE questions
Algorithms
12 questions and papers
GATE CS 2005 – Question 35
Suppose \(T(n) = 2T(n/2) + n\), with \(T(0) = T(1) = 1\).Which one of the following is FALSE?
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.