CSCI 2720

Data Structures

Spring 2007

Project 4 -- Hashing with separate chaining
Assigned: Thursday, March 8th
Due: Thursday, May 8th

See the Project 4 Grade Sheet and questions and answers regarding project 4 .

Description

Hash tables, as we implement them here, attempt to achieve the low cost lookup time of an array, while minimizing wasted memory, as in a list. In this assignment, you are provided with an outline of a templated hash table class, and are asked to provide the implementations for several key methods. Below are links to a set of files that implement hashing. Your job is to fill in the following the bodies of several of thos files:

Makefile
Hashnode.h and Hashnode.cc
Hashlink.h and Hashlink.cc (fill in *.cc file)
Hashtable.h and Hashtable.cc (fill in *.cc file)
HashTest.cc

Some sample input and output files:

sample.zero , samplezero.out
sample.one , sampleone.out
sample.two , sampletwo.out
sample.three , samplethree.out
sample.four , samplefour.out
sample.five , samplefive.out