Fill in the following table, showing the number of comparisons needed to find each value using the hashing representations given in Exercises 19–22.

Exercises 19–22.

19. Store the values in a hash table with 20 positions, using the division method of hashing and the linear probing method of resolving collisions.

20. Store the values in a hash table with 20 positions, using rehashing as the method of collision resolution. Use key % tableSize as the hash function, and (key + 3) % tableSize as the rehash function.

21. Store the values in a hash table with ten buckets, each containing three slots. If a bucket is full, use the next (sequential) bucket that contains a free slot.

22. Store the values in a hash table that uses the hash function key % 10 to determine into which of ten chains to put the value.

Transcribed Image Text:

66 Value 467 566 735 285 87 Exercise 19 Number of Comparisons Exercise 20 Exercise 21 Exercise 22