GATE 2012 · None
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 TRUE?
Related Algorithms PYQs
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running t…
Let G be a weighted graph with edge weights greater than one and G' be the graph constructed by squaring the weights of edges in G…
Consider the directed graph with vertices S, A, B, C, D, E, T. There are multiple shortest paths between vertices S and T. Which o…
Consider the directed graph with edge weights: (S, A)=1, (S, B)=2, (S, D)=4, (A, C)=1, (B, D)=3, (C, D)=1, (C, E)=2, (D, T)=2, (E,…
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…
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.