CS 2213 Advanced Programming, Spring 2001 Programming Assignment 3


Due In Class, Tuesday, April 10, 2001

In this assignment you will write routines to implement a hash table.
Use linear probing for collisions as discussed in class.

Create a directory called assign3 for this assignment.
Copy all of the files from /usr/local/courses/cs2213/spring2001/assign3 into this directory. The file hashtable.c already contains the function hashfunction. Write the other functions whose prototypes are in hashtable.h. Create a main program called hashtest.c for testing your hash table. You can use the makefile that you copied as a starting point. After your test is working use the makefile to run lint and save the output. You will have to hand it in.

When you think you have your hashtable working, use the makefile to compile runhashtest with your hashtable and the hashtester.o. Run the program and save the output. This output will also be turned in. If all tests complete correctly, the message

Congratulations, all OK!
will appear. Otherwise errors were detected.

Print out a copy of the cover page.
The cover page tells you what needs to be handed in.

Hand in everything in class on the due date.

Do not modify the hashtable.h file or the hashfunction function in hashtable.c.