============================================================================
           Faculty of Applied Science and Engineering, University of Toronto
                     CSC181: Introduction to Computer Programming, Fall 2000

Assignment 3 Supplementary Exercise
============================================================================

Instructions

1. Read slides 384-387 of the lecture notes, which discuss hash tables.

2. Implement the dictionary using a hashtable. In doing this, you should:

   - Organize the dictionary code appropriately into files
     hashdictionary.c and hashdictionary.h. Keep the same struct name
     (i.e. Dictionary) and function names (e.g. dictionaryInit).

   - Call the hashtable 'HashTable' and organize the code
     appropriately into files hashtable.c and hashtable.h.

   - Use a simple hash scheme and function. In particular, when
     handling collisions, use chaining (i.e. chain items that hash to
     the same entry in the table). Document this with a comment at the
     start of the hashtable.c file.

3. Electronically submit hashdictionary.c, hashdictionary.h,
   hashtable.c and hashtable.h using the conventional magic words.