Consider a hash table with 9 slots. The hash function is \(h(k) = k \ mod \…

PYQ GATE 2014

Consider a hash table with 9 slots. The hash function is h(k)=k mod 9h(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

  1. A.

    3, 0, and 1

  2. B.

    3, 3, and 3

  3. C.

    4, 0, and 1

  4. D.

    3, 0, and 2

Attempted by 269 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…