Problem
1. About how many probes are involved when double hashing is used to build a table consisting of N equal keys?
2. Which hashing method would you use for an application in which many equal • keys are likely to be present?
3. Suppose that the number of items to be put into a hash table is known in advance. Under what conditions will separate chaining be preferable to double hashing?