Given a hash table with n keys and m slots under simple uniform hashing,…

Given a hash table with n keys and m slots under simple uniform hashing, collisions are resolved by chaining. What is the probability that the first slot ends up empty?

  1. A.

    (1/m)n

  2. B.

    (1-1/m)n

  3. C.

    1/n

  4. D.

    (1-1/n)m

Attempted by 334 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…