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

PYQ GATE 2014

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. A.

    (97×97×97)/1003(97 × 97 × 97)/100^3

  2. B.

    (99×98×97)/1003(99 × 98 × 97)/100^3

  3. C.

    (97×96×95)/1003(97 × 96 × 95)/100^3

  4. D.

    (97×96×95)/(3!×1003)(97 × 96 × 95)/(3! × 100^3)

Attempted by 677 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…