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)/1003

(B) (99 × 98 × 97)/1003

(C) (97 × 96 × 95)/1003

(D) (97 × 96 × 95)/(3! × 1003)

Answer: (A)

Explanation:

Gate CS-2014-3 Question Paper With Solutions

Learn More:   Gate CS-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here