Question

 Given a number n = abc and with the hash function f(n) = (a*30+ b*31+c*32) mod 9. Then generate the hash table by following linear and quadratic probing resolution separately for the following data set: 476,192,215,729,318,620,586,828,434.

Answer 1

Data set: 476,192,215,729,318,620,586,828,434.

Getting the index of each item in the data set:

$Index\ of\ 476 = ( 4\times 30 + 7 \times 31 + 6 \times 32) mod\ 9 = 7\\ Index\ of\ 192 = ( 1\times 30 + 9 \times 31 + 2 \times 32) mod\ 9 = 4\\ Index\ of\ 215 = ( 2\times 30 + 1 \times 31 + 5 \times 32) mod\ 9 = 8\\ Index\ of\ 729 = ( 7\times 30 + 2 \times 31 + 9\times 32) mod\ 9 = 2\\ Index\ of\ 318= ( 3\times 30 + 1 \times 31 + 8\times 32) mod\ 9 = 8\\ Index\ of\ 620= ( 6\times 30 + 2 \times 31 + 0\times 32) mod\ 9 = 8\\ Index\ of\ 586= ( 5\times 30 + 8 \times 31 + 6\times 32) mod\ 9 = 5\\ Index\ of\ 828= ( 8\times 30 + 2 \times 31 + 8\times 32) mod\ 9 = 0\\ Index\ of\ 434= ( 4\times 30 +3 \times 31 + 4\times 32) mod\ 9 = 8\\$

Hash table generated by Linear Probing