Predicting Collisions for a Full File
Suppose you have a hashing function that you believe will distribute records randomly and you want to store 10,000 records in 10,000 addresses.
How many addresses do you expect to have no records assigned to them?
How many addresses should have one, two, and three records assigned respectively?
How can we reduce the number of overflow records?