Question: answer all parts Part a (15 points) A hash table T of size 10 is given. There are multiple keys already stored in the table
Part a (15 points) A hash table T of size 10 is given. There are multiple keys already stored in the table in positions 0,1 , and 2. Explain how to insert the following keys {10,15,20} one by one, using the following hash functions. h1(k)=k%4andh2(k)=(2k+1)%3 Part b (10 points) Explain whether the following hash family H={h1,h2,h3,h4,h5} is universal or not. h1,h2,h3,h4,h5:{K1,K2,K3,K4}{0,1,2,3,4}, and
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
