GATE 1997 Question - Marks 5
Consider a hash table with n buckets, where external (overflow) chaining is used
to resolve collisions. The hash function is such that the probability that a key
value is hashed to a particular bucket is 1/n.
The hash table is initially empty and K
distinct values are inserted in the table.
(a) What is the probability that bucket number 1 is empty after the Kth
(b) What is the probability that no collision has occurred in any of the K
(c) What is the probability that the first collision occurs at the Kth insertions?
Total 1 Questions