Consider a hash function that distributes keys uniformly. The hash table size…

PYQ GATE 2007Modified — slightly modified from the official paper; see the solution

Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed 0.5.

  1. A.

    5

  2. B.

    6

  3. C.

    7

  4. D.

    10

Attempted by 623 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…