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.
\((97 × 97 × 97)/100^3\)
B.
\((99 × 98 × 97)/100^3\)
C.
\((97 × 96 × 95)/100^3\)
D.
\((97 × 96 × 95)/(3! × 100^3)\)

Attempted by 502 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2