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): Hash table searching always guarantees O(1) time complexity in both average and worst cases.

Reason (R): Collision handling via chaining can degrade worst-case search time to O(N) if all keys map to the exact same bucket.

Choose the correct answer:

Explanation

Analysis of Assertion (A):
- Hash table searching provides $O (1)$ time complexity on average assuming a good hash function that distributes keys uniformly.
- However, it does not guarantee $O (1)$ in the worst case. If collisions occur heavily, search time can degrade to $O (N)$ .
- Therefore, Assertion (A) is False.
Analysis of Reason (R):
- In separate chaining, if a poor hash function or an adversarial input causes all $N$ keys to hash to the same bucket, all elements will form a single linked list of length $N$ .
- Searching through this linked list requires traversing $N$ elements, resulting in a worst-case time complexity of $O (N)$ .
- Therefore, Reason (R) is True.