Unformatted text preview: uniform. Let Î» be the load factor of the hash table. (a) The typical method of inserting a new key with double hashing is to first calculate the two hash values, and then to probe for an open position for the new key. What is the expected number of probes in order to find an open position, as a function of Î» ? (3points) (b) Assume that instead of computing the two hash values at the start, we compute just the first hash value initially and compute second hash value only when the position given by the first hash value is occupied and so probing is needed. On average, how many hash values will be calculated then to insert a new key (as a function of Î» )? (3points)...
View
Full
Document
This note was uploaded on 05/09/2008 for the course EECS 233 taught by Professor Rabinovich during the Spring '08 term at Case Western.
 Spring '08
 Rabinovich
 Algorithms

Click to edit the document details