Gate
Exam
Programming
Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming
simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first
3 insertions?
Read Solution (Total 1)
-
- first 3 slots are unfilled so ignore 100,99,98
remaining 3 slots are filled with repetition (97/100)*(97/100)*(97/100)..is the answer - 5 years agoHelpfull: Yes(0) No(0)
Gate Other Question