GATE CS 2014 Set 2 – Question 38
Suppose \(P\), \(Q\), \(R\), \(S\), \(T\) are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging…
GATE exam stream
GATE CS — Computer Science & IT
174 questions and papers
GATE CS 2012 – Question 16
Let \(W(n)\) and \(A(n)\) denote respectively the worst-case and average-case running time of an algorithm executed on an input of size \(n\). Which of the following is ALWAYS…
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
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.