Consider an m-slot hash table that resolves collisions by chaining. In the next few problems,…
Consider an m-slot hash table that resolves collisions by chaining. In the next few problems, we’ll figure out the expected number of elements that must be hashed into this table before every slot is “hit”—that is, until every cell of the hash table is ful
Suppose that the hash table currently has i − 1 filled slots, for some number i ∈ {1, . . . , m}. What is the probability that the next element that’s hashed falls into an unoccupied slot? Let the random variable Xi denote the number of elements that are hashed until one more cell is filled. What is E [Xi]?