Concept drill
big-theta
GATE CSE & IT · Complexity Theory · 2017-2025
4
PYQs
100%
keyed
0
elite explanations
4
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs 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
2024 Q15
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?
mediumanswer key
2022 PYQ
Which one of the following statements is TRUE for all positive functions f(n) ?
mediumanswer keybasic explanation
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