Hashing | Chaining | Chain Length | The maximum, minimum, average chain lengths in the hash table

GATE 2014 | Programming and Data Structures | Hashing
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are
(A) 3, 0, and 1
(B) 3, 3, and 3
(C) 4, 0, and 1
(D) 3, 0, and 2
Answer: (A)
GATE - 2014
SUBJECT - Programming and Data Structures
TOPIC - Hashing
MARKS - 2
SET - 1
TYPE OF QUESTION - MCQ
PAPER - CS
12