GATE 2007
Let G = (V, E) be a directed graph where |V| = n and |E| = m. What is the time complexity of testing whether G contains a cycle using Depth-First Search (DFS)?
Related Algorithms PYQs
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound …
In the following C function, let n >= m. ```c int gcd(int n, int m) { if (n % m == 0) return m; n = n % m; return gcd(…
Consider the following C code segment: ```c int IsPrime(int n) { int i; for (i = 2; i <= sqrt(n); i++) if (n % i =…
What is the Asymptotic Notation of the following recursive function: ```c int DoSomething (int n) { if (n <= 2) return 1; …
Consider the following C-program fragment in which i, j, and n are integer variables. for (i = n, j = 0; i > 0; i /= 2, j += i); L…
Consider the following recurrence: T(n) = 2T(⌊sqrt(n)⌋) + 1, T(1) = 1 Which one of the following is true?
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.