Consider a hash table with 100 slots. Collisions are resolved using chaining.…
PYQ GATE 2014
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?
- A.
- B.
- C.
- D.
Attempted by 677 students.
Sign up free to check your answer
Sign up freeLoading lesson…

