Programming Assignment V
COP3502H
Due: 4/23/07 11:59pm
The CEO of the Computer Sciences Corporation, Dr. Link Queue has just hired Dr.
Johnny Hash, the new vice president of product development. The first thing Dr. Hash
does whenever he starts a new job is to have the company design and implement a hash
table. The problem is Dr. Hash has memory loss and does not remember which hashing
functions work best. Therefore, in this assignment, you will implement a hash table and
several different hash functions, examine their performance and produce a report on your
findings.
Requirements
You will develop a hash table that will be used to insert, delete, and search for keys. In
this case, the keys will be social security numbers (a nine digit number). You will be
given a file with 1000 random social security numbers to use for testing. For collision
detection, your hash table should use chaining. You should be able to use your linked list
code for the chains. The hash table will simply be an array where each element is a
pointer to a linked list (or NULL if it is empty). The size of your hash table should be on
the order of a 100 or so. You will also need to implement the 5 hash functions we
discussed in class,
Hashing by 1. Division
2. Multiplication
3. Folding
4. Middle squaring
5. Truncation
For each of these hash functions, you must decide what the constants should be.
You should provide a menu driven interface that lets users try the different hash functions
and perform other operations. These operations should include
1. Initialize Hash Table
2. Choose Hash Function
3. Load SSN Numbers from file
4. Insert a SSN number
5. Delete a SSN Number
6. Search for a SSN Number
7. Print out Hash Table
