Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted that at least a chain of size 3 is created? (Assume simple uniform hashing is used) $m^{–2}$ $m^{–4}$ $m^{–3} (m – 1)$ $3m^{–1}$

answered
6 days ago
in Algorithms
Subhajit Panday
3.1k views