CS 223 Out-lab 3
Week of 2/6

Due: to TA by 2/16

Hash Tables

Take the code that you wrote for the in-lab.

• Put in a delete method that doesn't mess up the hashing indexes.
• Make sure you aren't rehashing deleted items when you double the size of the array.
• A hash table print() method that neatly prints out the contents of the hash table including empty slots and deleted elements.

Test your code on the previous example file from the in-lab.  Delete Adam, Moe,  Lloyd, Kevin and Homer.  Print out the table before and after the deletion sequence.

What to Turn In

• a printed copy of all source code.  Ensure the source code is documented.
• a printout of a test run of the driver with the above deletion sequence.