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.
- A.
5
- B.
6
- C.
7
- D.
14
Attempted by 532 students.
Sign up free to check your answer
Sign up freeLoading lesson…