1. [Hash table] Assume we have a hash table of size 7, key-value pairs which are...

Transcribed Image Text:

1. [Hash table] Assume we have a hash table of size 7, key-value pairs which are both integers, and the following hash function: h(x) = (3 * x + 5) mod 11 %3D a) The hash function above will generate hashes that are not usable by our hash table. Please ADD SOMETHING to the hash function (do NOT remove anything) so that it will work most properly. Write down the updated function in the answer book. (4%) b) Please write down the hashes for key = 2, 6, 8 and 13 with the updated function. (2%) c) Assuming linear probing, what will be inside the hash table after the key value pairs of <2,1>, <6,2>, <13,3> and finally <8,4> are inserted? Please draw the hash table to illustrate. (5%) d) Draw the results in c) if we use quadratic probing instead. (4%) 1. [Hash table] Assume we have a hash table of size 7, key-value pairs which are both integers, and the following hash function: h(x) = (3 * x + 5) mod 11 %3D a) The hash function above will generate hashes that are not usable by our hash table. Please ADD SOMETHING to the hash function (do NOT remove anything) so that it will work most properly. Write down the updated function in the answer book. (4%) b) Please write down the hashes for key = 2, 6, 8 and 13 with the updated function. (2%) c) Assuming linear probing, what will be inside the hash table after the key value pairs of <2,1>, <6,2>, <13,3> and finally <8,4> are inserted? Please draw the hash table to illustrate. (5%) d) Draw the results in c) if we use quadratic probing instead. (4%)

Answer rating: 100% (QA)

hx 3 x 5 mod 11 For x 1 h1 3 1 5 mod 11 8 mod 11 8 For x 2 h2 3 2 5 mod 11 11 mod 11 0 Fo... View the full answer