Match List I with List II List I (Hashing Collision Handling Method) List II…
2025
Match List I with List II
List I (Hashing Collision 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:
- A.
A-II, B-III, C-I, D-IV
- B.
A-II, B-III, C-IV, D-I
- C.
A-III, B-I, C-IV, D-II
- D.
A-IV, B-II, C-I, D-III
Attempted by 324 students.
Show answer & explanation
Correct answer: C
Correct matching: match each collision-handling method with its strategy.
Chaining → Linked list at index. Colliding elements are stored in a linked list (or another container) at the same hash table slot.
Linear probing → Check next slot. On collision, try the next sequential slots until an empty one is found.
Quadratic probing → Skip slots using quadratic step. Use a probe sequence based on a quadratic function of the probe number (e.g., i^2) to reduce clustering.
Double hashing → Use second hash function. Compute a second hash to determine the step size for probing, giving a different probe sequence for each key.
Why other matchings are incorrect: Common mistakes include confusing chaining (which uses per-index containers) with open-addressing methods, or swapping the probing behavior of linear, quadratic, and double hashing.
A video solution is available for this question — log in and enroll to watch it.