A hash table of size 10 uses the hash function h(k) = k mod 10 with linear…

A hash table of size 10 uses the hash function h(k) = k mod 10 with linear probing to resolve collisions (on a collision, the next slot in increasing order, wrapping around, is tried). The keys 42, 23, 34, 52, 46, and 33 are inserted one at a time, in some order, into an initially empty table, producing the hash table shown below. How many different insertion sequences of these six keys will result in exactly this hash table?

  1. A.

    10

  2. B.

    20

  3. C.

    30

  4. D.

    40

Attempted by 113 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…