This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: a. If a word hashes to a location with value 0, the word is not in the dictionary. b. If a word hashes to a location with value 1, then the word is in the dictionary. c. What is the probability of an error in this algorithm? d. A typical document might have about three actual misspellings per page of 500 words. Is this algorithm usable? 3 3. Show the result of inserting the keys 10111101, 00000010, 10011011, 10111110, 01111111, 01010001, 10010110, 00001011, 11001111, 10011110, 11011011, 00101011, 01100001, 11110000, 01101111 into an initially empty extendible hashing data structure with M=4....
View Full Document
- Fall '06