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?
- A.
(1/m)n
- B.
(1-1/m)n
- C.
1/n
- D.
(1-1/n)m
Attempted by 334 students.
Sign up free to check your answer
Sign up freeLoading lesson…

