GATE 2024 · CS2 - Afternoon
Let T(n) be the recurrence relation defined as follows:
T(0) = 1, T(1) = 2, and T(n) = 5T(n-1) - 6T(n-2) for n ≥ 2
Which one of the following statements is TRUE?
Related Algorithms PYQs
Given an integer array of size N, we want to check if the array is sorted (in either ascending or descending order). An algorithm …
Consider the following recurrence relation: T(n) = \(\sqrt{n}\)*T(\(\sqrt{n}\)) + n for n ≥ 1, T(n) = 1 for n = 1. Which one of th…
Let G be a directed graph and T a depth first search (DFS) spanning tree in G that is rooted at a vertex v. Suppose T is also a br…
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let G be any graph with …
The number of edges present in the forest generated by the DFS traversal of an undirected graph G with 100 vertices is 40. The num…
Let A be an array containing integer values. The distance of A is defined as the minimum number of elements in A that must be repl…
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.