Implement hashing to store integers. Resolve collision using the method of chaining. Use a hash function like h(k) = k mod 701, if the size of your hash table is 701(m, a prime) (; though this is not required for chaining). You should support insertion, searching and deletion. Use a doubly linked list for the chains to minimize deletion time once a key has been found.

This program will be continued in the next laboratory.
Available from: Monday, 30 March 2009, 11:25 AM
Due date: Monday, 6 April 2009, 9:55 AM