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?
Answers
Answered by
1
(97 × 97 × 97)/100^3
Explanation:
Exp: A
 hope it will help u
Explanation:
Exp: A
 hope it will help u
Similar questions