1 Do the same as in Exercise 11.1 but use the following hash function to map the keys to the table entries: h(key) = (2 _ key + 3) % 11 2 Show the contents of the hash table from Exercise 11.1 after...

1 Do the same as in Exercise 11.1 but use the following hash function to map the keys to the table entries: h(key) = (2 _ key + 3) % 11

2 Show the contents of the hash table from Exercise 11.1 after rehashing with a new table containing 19 entries.

3 Consider a hash table of size 501 that contains 85 keys.

(a) What is the load factor?

(b) What is the average number of comparisons required to determine if the collection contains the key 73, if:

i. linear probing is used

ii. quadratic probing is used

iii. separate chaining is used