4. (a) Let be the hash function; and di d (di-1 + ((5 k) mod 10)...

   

Transcribed Image Text:

4. (a) Let be the hash function; and di d (di-1 + ((5 k) mod 10) + 1) mod 13, H(k), be the opening addressing collision resolution method. Insert the keys {23, 21, 43, 16, 30, 19, 02, 87, 48, 99} into a hash table of 13 slots (with slots numbered 0 through 12) and show the result of the final hash table. (You are required to show how you use H and di to do the hashing.) [25 marks] = H(k) = (3. k) mod 13 = i 2, (b) Find the average search length of a successful search, assuming all keys are required with equal probability. [5 marks] 4. (a) Let be the hash function; and di d (di-1 + ((5 k) mod 10) + 1) mod 13, H(k), be the opening addressing collision resolution method. Insert the keys {23, 21, 43, 16, 30, 19, 02, 87, 48, 99} into a hash table of 13 slots (with slots numbered 0 through 12) and show the result of the final hash table. (You are required to show how you use H and di to do the hashing.) [25 marks] = H(k) = (3. k) mod 13 = i 2, (b) Find the average search length of a successful search, assuming all keys are required with equal probability. [5 marks]