Question: 5. Suppose we have a hash table with 10 elements. (a) Given the numbers below, which of the following hash functions is the BEST? Be

5. Suppose we have a hash table with 10 elements. (a) Given the numbers below, which of the following hash functions is the BEST? Be sure to explain your answer. For all functions, use linear probing as the method of resolving conflicts. Here are the hash functions: i. H(X) X mod 10 ii. H(X) (X / 10) mod 10 H(X) (X / 100) mod 10 Here are the numbers: 100, 592, 600, 455, 170, 330. (10 marks) (b) Show the final hash table after the insertions are done using your preferred solution from Question 5(a). (6 marks) (c) Now delete 100 and then 600 from your hash table from Question 5(b). Be sure to show the table after each value is deleted. (4 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
