hash8

1. Hashing (20) Given the input (84, 12,48, 16, 38, 108, 36,60, 72, 63) and a hash function h(z)- mod 10, show what happens when each element in the list is inserted into the hash table of size 10 using the following collision policy. (a) (4) Open hash table. Explain what method of insertion you are using. (b) (4) Closed hash table using linear probing (assuming that the increment is 1). (c) (4) Closed hash table with second hash function h2(x)-3-x mod 3. d) (4) What are the advantages and disadvantages of the various collision strategies in the first two questions? Justify your answer (e) (4) Which hash function is a better hash function for the above sequence: (1) hi() mod 12 or (2) h2() mod 11? Justify your answer. Note that the size of hash table will change according to hash function