Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

Algorithm Analysis

GATE CSE & IT · Algorithms - Recurrence Relations · 2010-2025

3
PYQs
100%
keyed
1
elite explanations
3
years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2025 Q20

Consider the following recurrence relation: T(n) = 2T(n - 1) + n2^n for n > 0, T(0) = 1. Which ONE of the following options is CORRECT?

mediumanswer key
2017 Q30

Consider the recurrence function T(n) = { 2T(√n) + 1, n > 2; 2, 0 < n ≤ 2. Then T(n) in terms of Θ notation is

mediumanswer key
2010 PYQ

Two alternate packages A and B are available for processing a database having 10 k records. Package A requires 0.0001n 2 time units and package B requires $$10n.\log _{10}^n$$ time...

mediumanswer keyelite explanation