Consider a hash table with 100 slots. Collisions are resolved using chaining.…
GATE · 2014 · CS · Set 3 · Computer Science & ITISRO Scientist/Engineer SC · 2018 · Computer Science · from our question bank (not an official paper) (question pool)
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 542 students.
Sign up free to check your answer
Sign up freeLoading lesson…