engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Searching, Sorting and Hashing Searching
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?
1
(97 × 97 × 97) / 1003
2
(99 × 98 × 97) / 1003
3
(97 × 96 × 95) / 1003
4
(97 × 96 × 95) / (3! × 1003)