Question

Rewrite your solution to part (b) using rehashing as the method of collision resolution. Use [(key+3) mod table-size] as rehash function.

Answer 1

Rehash function [(key+3) mod table size] 

H(25) = 28 mod 11 

H(42) = 45 mod 11 

H(96) = 99 mod 11 

H(101) = 104 mod 11 

H(102) = 105 mod 11 

H(162) = 165 mod 11 

H(197) = 200 mod 11 

H(201) = 204 mod 11

The newly created hash function is as follows:- 

Hash[0] = [96] 

Hash[1] = [42] 

Hash[2] = [162] 

Hash[3] = [197] 

Hash[4] = [NULL] 

Hash[5] = [101] 

Hash[6] = [25] 

Hash[7] = [102] 

Hash[8] = [201] 

Hash[9] = [NULL] 

Hash[10] = [NULL]