Lecture 25

Learning objectives

After this class, you should be able to:

1. Describe the idea of hashing and desirable features of hash functions.
2. Given a hash function, compute the hash value of an item.
3. Given a hash function, the hash table size, and a sequence of insertions, draw the state of the open-addressed hash table after the insertions are complete.
4. Explain how collisions are resolved in open-addressed hashing, and define linear probing.
5. Given a hash function, the hash table size, a collision resolution strategy, and a sequence of insertions and searches, give the number of hash table entries searched in each insert and search operation.
6. Derive the worst case and expected case time complexities for hash table insertion and search.
7. Identify applications where hash tables can be useful.

Reading assignment

1. Chapter 10, up to (and including) section 10.2.1, class notes.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Give an application where a hash table will be better than other data structures that we have discussed.
  2. Give an example of two words in English where the hash function f1, mentioned in class, will have the same hash values. Give a similar example for f2. Which example was easier to find?
  3. /usr/lib/spell/hashmake on program gives hash values for strings. Which hash function do you consider better, f2 or the one used by hashmake? This is an open ended question, and the answer depends on the application. You might, for instance, evaluate the two methods by studying the distribution of hash values for words in /usr/share/lib/dict/words or text files that you think are representative of words encountered in practice.
  4. Show the state of an open-addressed hash table of size 23 with p(i) = i + 3 after the following sequence of operations are complete. Also give the number of hash table entries searched for each of the following operations. Use the function f1 defined in class, for the hashing. insert("abcd"), insert("dbcd"), search("decd"), insert("abdc"), insert("bbcd"), insert("dabc"), search("decd"), insert("decd").

• Questions on next lecture's material
  1. None.

---

Last modified: 8 Apr 2008