Tomorrow (December 3) we will have the first of two lectures on
hashing. This one is by Mernoosh Sameki and will include, 

- Why and where do we use hash tables?
- Hash functions- What makes a good hash function?
-Collision resolution schemes: 
            - Average case analysis of hashing with chaining
     -Open addressing
           -Linear probing
           -Quadratic probing
           -Double hashing
     - Analysis of open-address hashing
- Bloom Filter definition, example, and analysis

These are some suggested materials for reading:

CLRS- Chapter 11