GATE 2023 · CS - Forenoon
Let f and g be functions of natural numbers given by f(n) = n and g(n) = \(n^{2}\).
Which of the following statements is/are TRUE?
Related Algorithms PYQs
Consider functions Function_1 and Function_2 expressed in pseudocode as follows: Function_1: while n > 1 do for i = 1 to n do …
Let G be a simple, finite, undirected graph with vertex set {v1,...,vn}. Let Delta(G) denote the maximum degree of G and let N = {…
Let U = {1,2,3}. Let \(2^{U}\) denote the powerset of U. Consider an undirected graph G whose vertex set is \(2^{U}\). For any A,B…
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.