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): The worst-case time complexity of Interpolation Search can degrade to O(N).

Reason (R): If values in a sorted array grow exponentially (e.g., 1, 10, 100, 1000...), the interpolation probe formula fails to make substantial geometric reductions in the search interval per iteration.

Choose the correct answer:

Explanation

Analysis of Assertion (A):
- Interpolation Search achieves an average-case time complexity of $O (lo g lo g N)$ when elements are uniformly distributed.
- However, when the data distribution is heavily skewed or non-uniform, the algorithm may reduce the search space by only 1 element per iteration, leading to a worst-case time complexity of $O (N)$ .
- Therefore, Assertion (A) is True.
Analysis of Reason (R):
- The probing formula for Interpolation Search assumes a uniform linear distribution across elements.
- If values grow exponentially (e.g., $1, 10, 100, 1000 \dots$ ), the probe calculation places the target estimate extremely close to one boundary (reducing the search interval linearly by just one element at a time) rather than dividing the space geometrically.
- Therefore, Reason (R) is True.
Relationship between (A) and (R):
- The failure to achieve substantial geometric reductions when elements grow exponentially is precisely why the worst-case time complexity degrades to $O (N)$ .
- Hence, (R) is the correct explanation of (A).