Hints for mini-exam 4 (11 May 2007)
-----------------------------------
Binary Heaps
------------
    - Structure and Ordering property
    - Big-O operations and average time calculations
        - understand *why* the average case is what it is
    - bubble-down and bubble-up operations
    - linear time heap construction
    - HeapSort

Hash Tables
-----------
    - Maps and Dictionaries
    - Bucket arrays
    - Hash functions
    - Types of collision handling
        - Linear Chaining
        - Open addressing
            - Linear Probing
            - Quadratic Probing
            - Double Hashing

    - Compression maps
        - Modulus (don't forget absolute value!)
        - MAD Method (Mult, Add, Divide)