Gate CS-2014-3 Question Paper With Solutions

Q. 50 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) (97 × 97 × 97)/100³

(B) (99 × 98 × 97)/100³

(C) (97 × 96 × 95)/100³

(D) (97 × 96 × 95)/(3! × 100³)

Answer: (A)

Explanation: