CUET PG 2026 — DSA PYQ

Q: How do I solve CUET PG 2026 DSA questions?

Practice CUET PG 2026 DSA previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

Q: What is the difficulty level of CUET PG DSA questions?

CUET PG DSA questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Q: Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

Question

CUET PG 2026 — DSA PYQ

CUET PG | DSA | 2026

Assertion (A): A recursive function that makes two recursive calls per frame generates a call stack space complexity equal to the total number of nodes in its recursion tree.

Reason (R): The maximum active call stack depth at any given moment corresponds only to the maximum height of the recursion tree, not total nodes.

Choose the correct answer:

Explanation

Analysis of Assertion (A):
- Call stack space complexity is determined by the maximum number of stack frames active simultaneously at any single point in time, not the cumulative total number of function calls made throughout execution.
- For a recursive function with two recursive calls per frame (e.g., standard recursive Fibonacci or Binary Tree traversal), calls are executed sequentially (depth-first), so stack frames are pushed and popped along a single path.
- Therefore, space complexity is proportional to the height of the recursion tree, not the total number of nodes in the tree.
- Hence, Assertion (A) is False.
Analysis of Reason (R):
- At any moment during execution, the call stack only stores frames along the active path from the root node to the current node.
- This maximum path length equals the height/depth of the recursion tree.
- Hence, Reason (R) is True.