CUET PG 2025 — Computer PYQ

Q: How do I solve CUET PG 2025 Computer questions?

Practice CUET PG 2025 Computer 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 Computer questions?

CUET PG Computer 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 2025 — Computer PYQ

CUET PG | Computer | 2025

All the elements that hash to the same slot are placed into the same linked list in:

Choose the correct answer:

Explanation

Right Answer:

Chaining (ya Separate Chaining)

Solution:

Hashing mein jab do ya do se zyada keys ek hi index (slot) par map ho jati hain (Collision), toh Chaining method ka upyog kiya jata hai. Isme har slot ek linked list ka head pointer hota hai.

Mathematical Logic:

Maan lijiye hamare paas ek hash function $h(k)$ hai aur ek hash table $T$ hai. Agar keys $k_1, k_2, \dots, k_m$ ek hi slot $i$ par hash hoti hain, toh:

h(k_1) = h(k_2) = \dots = h(k_m) = i

Tab in sabhi elements ko index $T[i]$ par ek linked list mein store kiya jata hai:

T[i] \rightarrow \text{head} \rightarrow k_1 \rightarrow k_2 \rightarrow \dots \rightarrow k_m

Performance:

Search Time (Worst Case): Agar saare $n$ elements ek hi slot par chale jayein:

$O(n)$
Search Time (Average Case): Load factor $\alpha = n/m$ ke saath:

$O(1 + \alpha)$