As discussed in this chapter, the linear probing technique used for collision resolution h...

As discussed in this chapter, the linear probing technique used for collision resolution has a rapidly deteriorating performance if a relatively small percentage of the cells are available. This problem can be solved using another technique for resolving collisions, and also by finding a better hash function, ideally, a perfect hash function. Write a program that evaluates the efficiency of various hashing functions combined with the linear probing method. Have your program write a table similar to the one in Figure 1, which gives the averages for successful and unsuccessful trials of locating items in the table. Use functions for operating on strings and a large text file whose words will be hashed to the table. Here are some examples of such functions (all values are divided modulo TSize):

a. FirstLetter(s) + SecondLetter(s) + • • • + LastLetter(s)

b. FirstLetter(s) + LastLetter(s) + length(s) (Cichelli)

c. for (i = 1, index = 0; i (Ramakrishna)

Figure 1 The average numbers of successful searches and unsuccessful searches for different collision resolution methods.