GATE 2022
Consider the following recurrence:
f(1) = 1;
f(2n) = 2f(n) - 1, for n ≥ 1;
f(2n+1) = 2f(n) + 1, for n ≥ 1.
Then, which of the following statements is/are TRUE?
Related Algorithms PYQs
Which one of the following statements is TRUE for all positive functions f(n)?
Consider a simple undirected weighted graph G, all of whose edge weights are distinct. Which of the following statements about the…
Let G(V,E) be a directed graph, where V = {1,2,3,4,5} is the set of vertices and E is the set of directed edges, as defined by the…
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.