Considering a hash table with 100 slots. Collisions are resolved using chaining.

Loading

โœช Choose the correct option.

Considering 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? (NOTE:100 ^ 3 means 100 raised to the power 3)

A. (97 * 96 * 95) / 100 ^ 3
B. (97 * 96 * 95) / (6 * 100 ^ 3)
C. (97 * 97 * 97 ) / 100 ^ 3
D. (99 * 98 * 97) / 100 ^3

Leave a Comment