GATE 2011
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1(n) = 2^n, f2(n) = n^(3/2), f3(n) = n log2 n, f4(n) = n^(log n)
Related Algorithms PYQs
An undirected graph G(V,E) contains n (n > 2) nodes named v1, v2... vn. Two nodes vi, vj are connected if and only if 0 < |i - j| …
For the graph defined in the previous question with n = 10, the length of the path from v5 to v6 in the MST is
The minimum number of scalar multiplications required to compute the matrix chain product A1 x A2 x A3 x A4 with dimensions 10 x 3…
Consider the following recurrence relations: for all n > 1, T1(n) = 4*T1(n/2) + T2(n), and T2(n) = 5*T2(n/4) + \(\Theta(\log_2 n)\…
Let G(V,E) be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges…
Let G(V,E) be a simple, undirected graph. A vertex cover of G is a subset V' subset of V such that for every (u,v) in E, u in V' o…
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.