Official answer key is not available for this question yet.
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 2021Set 2PYQNATanswer pendingexplanationmedium
Programming Languages · Complexity Theory
Concept intelligence
Jump into a concept drill from this question.
Recurring concept
See all 99 →Complexity Theory has appeared in GATE CSE & IT 99 times across 36 years (2022, 2023, 2024, 2025, 2026, ...).
More questions on Complexity Theory
See all →- 2026 QConsider the following recurrence relations: For all $n>1$, $$ \begin{aligned} & T_1(n)=4 T_1\left(\frac{n}{2}...
- 2026 QConsider the following functions, where $n$ is a positive integer. $$ n^{1 / 3}, \log (n), \log (n!), 2^{\log...
- 2026 QWhich of the following can be recurrence relation(s) corresponding to an algorithm with time complexity $\Thet...
- 2026 QConsider an array $A$ of integers of size $n$. The indices of $A$ run from 1 to $n$. An algorithm is to be des...
- 2026 QConsider the recursive functions represented by the following code segment: int bar(int n){ if (n == 1) return...
- 2025 QConsider the following recurrence relation : $$T(n)=2 T(n-1)+n 2^n \text { for } n>0, T(0)=1$$ Which ONE of th...
- 2025 QConsider the following C program : #include <stdio.h> int g(int n) { return (n+10); } int f(int n) { return g(...
- 2024 QConsider the following C program: #include <stdio.h> int main() { int a = 6; int b = 0; while(a Which one of...
∑ has math
recursionc-programtracing