CUET PG 2025 — Computer PYQ

Right Answer:

Hashing (ya Hash Table)

Solution:

Hashing ek aisi technique hai jahan data ko store aur search karne ka samay elements ki sankhya ($n$) par nirbhar nahi karta.

Mathematical Logic:

Average case mein, ek Hash Table mein search operations ke liye lagne wala samay hamesha constant rehta hai:

Yahan $O(1)$ ka matlab hai ki search time hamesha constant hai, chahe $n$ ki value kitni bhi badi kyon na ho:

Comparison with other Search Techniques:

• Linear Search:

  $$O(n)$$

  (Elements badhne par samay badhta hai)

• Binary Search:

  $$O(\log n)$$

  (Elements badhne par samay thoda badhta hai)

• Hashing:

  $$O(1)$$

  (Independent of $n$)