T Naughton, CS NUIM
Back to CS211 home

Repeat of Problem 10.1 A hash table of length 100 is required to store a list of friends' telephone numbers. Each element of the array will contain a string (or character array) to hold the first name, a string (or character array) to hold the number, and a variable to indicate whether the element is empty, used, or deleted. The name will be the key for the hash table; your hash function should simply convert the first character of the name into its corresponding ASCII integer, and use this integer as the index.