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

GATE · 2007 · ITModified — 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.

    14

Attempted by 506 students.

Show answer

Correct answer: D

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…