Q31.Marks: +2.0UGC NET Paper 2: Computer Science and Application 26th June 2025 Shift 1
Match List I with List II
List I (Hashing Collison Handling Method)
List II (Strategy)
A. Chaining
I. Check next slot
B. Linear Probing
II. Use second hash function
C. Quadratic Probing
III. Linked list at index
D. Double Hashing
IV. Skip slots using quadratic step
Choose the correct answer from the options given below:
1.A-II, B-III, C-I, D-IV
2.A-II, B-III, C-IV, D-I
3.A-III, B-I, C-IV, D-II✓ Correct
4.A-IV, B-II, C-I, D-III
Solution
Statement:
The Correct answer is option 3: A-III, B-I, C-IV, D-II.
Explanation:
Chaining:
Chaining is a collision handling method where a linked list is maintained at each index of the hash table.
When a collision occurs (multiple keys mapping to the same index), the new element is added to the linked list at that index.
Therefore, A matches with III (Linked list at index).
Linear Probing:
Linear Probing is a collision resolution strategy where, if a collision occurs, the next slot in the hash table is checked sequentially until an empty slot is found.
This method uses a linear sequence of steps to resolve collisions.
Therefore, B matches with I (Check next slot).
Quadratic Probing:
Quadratic Probing is a collision resolution strategy where the next slot is determined using a quadratic function.
Instead of checking slots sequentially, it skips slots using a quadratic step (e.g., 1², 2², 3², etc.) to avoid clustering of keys.
Therefore, C matches with IV (Skip slots using quadratic step).
Double Hashing:
Double Hashing is a collision resolution method where a second hash function is used to determine the next slot in case of a collision.
This ensures better distribution and reduces clustering compared to linear and quadratic probing.
Therefore, D matches with II (Use second hash function).