GATE 2008
The running time of an algorithm is represented by the following recurrence relation:
T(n) = n for n <= 3
T(n) = T(n / 3) + cn otherwise
Which one of the following represents the time complexity of the algorithm?
Related Algorithms PYQs
Consider the following functions: f(n) = 2^n g(n) = n! h(n) = n^(log n) Which of the following statements about the asymptotic beh…
When n = 2^(2^k) for some k >= 0, the recurrence relation T(n) = sqrt(2) * T(n / 2) + sqrt(n), T(1) = 1 evaluates to:
Arrange the following functions in increasing asymptotic order: a. n^(1/3) b. e^n c. n^(7/4) d. n * log9 n e. 1.0000001^n
The average case and worst case complexities for Merge sort algorithm are
For an undirected, weighted graph, which of the following sequences of edges represents a correct execution of Prim's algorithm to…
Consider a weighted, undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shor…
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.