Algorithms · Asymptotic Analysis
Official IIT answer key · IIT Roorkee · Audited Aug 2026
GATE CSE 2026 Set 2 Q38 · MCQ · 2 marks
Key concept
No account needed
Sit 5 related Asymptotic AnalysisPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Across GATE CS exam papers, asymptotic complexity is evaluated through rigorous mathematical analysis and algorithmic code inspection. Questions consistently focus on solving recurrence relations (using the Master Theorem, Akra-Bazzi, recursion trees, and variable substitution), ranking growth rates of non-trivial functions (including log-log, oscillating, and super-polynomial forms), and calculating the exact operation counts of nested loops and multi-step data structure operations. The evaluation spans both conceptual formal definitions (O, , , o, ) and practical application to standard algorithmic procedures.
Full Asymptotic Analysis guide →Consider an array A of integers of size n. The indices of A run from 1 to n. An algorithm is to be designed to check whether A satisfies the condition given below. i, j \1, , n - 1\ such that i > j, (A[i + 1] - A[i]) > (A[j + 1] - A[j]) Which one of the following gives the worst case time complexity of the fastest algorithm that can be designed for the problem?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
