GATE 2025 · CS1 - Forenoon
Consider the following recurrence relation:
T(n) = 2T(n-1) + n*\(2^{n}\) for n > 0, T(0) = 1.
Which ONE of the following options is CORRECT?
Related Algorithms PYQs
Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, le…
The pseudocode of a function fun() is given below: ```text fun(int A[0,...,n-1]){ for i=0 to n-2 for j=0 to n-i-2 if (…
Let G(V,E) be an undirected and unweighted graph with 100 vertices. Let d(u,v) denote the number of edges in a shortest path betwe…
Consider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer i…
Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph …
Let G be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant α is added to the weight of eve…
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.