Suppose you insert three keys into a hash table

Suppose you insert three keys into a hash table with m slots. Assuming the simple uniform hashing assumption, and given that collisions are resolved by chaining, what is the probability that both slots 0 and 1 are empty?

(A) (m−2) /(m−1)
(B) (m−2) /m
(C) ((m−2) /m )3
(D) None

 

Answer: C

1Comment
NITIN BHAGWAT @nitinbhagwat 9 Jan 2018 03:20 pm

Can anyone give me the explainaton of this answer?