SA-7

Exercises

Consider a hash table that uses an array of 13 elements and a simple corresponding hash function h(i) = i mod 13. Insert the following numbers in order, showing the final resulting hash table both under chaining and linear probing:

17, 24, 4, 45, 30, 38, 2, 12

1. Illustrate the final hash table from chaining.
2. Illustrate the final hash table from linear probing.

Submission Instructions

Turn in a document illustrating the two hash tables. No code is required, just diagrams.