Analysis of chaining, universal chaining, open addressing, direct address tables, hash functions.
Understand the design and run-time characteristics of hash tables and how they compare to related data structures.
Examples of hash functions and universal chaining
Screencast Suthers 13 min
Using open addressing to avoid the overhead of linked lists.
Screencast Suthers 16 min
Direct address tables, hash tables, hash functions, and open addressing
Textbook 23 pages