- A.
- B.
- C.
- D.
Studying seriously for GATE CSE?
Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.
See GATE CSE betaOpen notebookGATE 2025Set 1Q20MCQanswer keyexplanation soonmedium
Computer Science · Algorithms - Recurrence Relations
Concept intelligence
Drill mode: recurrence-relation · 4/58
Recurring concept
See all 4 →Algorithms - Recurrence Relations has appeared in GATE CSE & IT 4 times across 3 years (2017, 2024, 2025).
More questions on Algorithms - Recurrence Relations
See all →- 2024 Q42Consider the following recurrence relation: $T(n) = \begin{cases} \sqrt{n}T(\sqrt{n}) + n & \text{for } n \geq...
- 2024 Q15Let 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...
- 2017 Q30Consider the recurrence function T(n) = { 2T(√n) + 1, n > 2; 2, 0 < n ≤ 2. Then T(n) in terms of Θ notation is
∑ has math
recurrence relationbig-thetaalgorithm analysisdivide and conquer