Instructions:

$>$ Submit the java project folder as a $.$zip file.

Write a java program to implement the following algorithms for Open Addressing techniques for

Hash Table data structure. $($Use a simple array of integers to store integer key values only$).$

For both algorithms, to compute the index $j,$ write the following methods:

getLinearProbIndex $($key$,$ i$)$

getQuadraticProbIndex $($key$,$ i$)$

getDoubleHash $($key$,$ i$)$

Linear Probing index is computed using following hash function:

$h(k,i)=(h_1(k)+i)modm$

$h_1(k)=$kmodm

Quadratic probing index is computed using following hash function:

h$($k$,$i$)=($h$\_(1)($k$)+$i$^(2))$modm h$\_(1)($k$)=$kmodm Double hashing index is computed using following hash function: h$($k$,$i$)=($h$\_(1)($k$)+$ih$\_(2)($k$))$modm h$\_(1)($k$)=$kmodm h$\_(2)($k$)=1+($kmodm$-1)$