The assignment should use these numbers: 24 89 45 92 81
43 17 88 48 28 67 42 31 53 99 20. Please Follow each and
every prompt.
For this assignment, you will add your numbers (in order) to
1. a hash table using linear probing to resolve collisions, and
2. a hash table using separate chaining to resolve collisions.
For the linear probing hash table, use $\alpha \leq 0.75$ as your threshold. Start with a table of size 11 and
resize to 23 if necessary. It would help grading if you put an asterisk next to any entries that had to be
moved due to collisions (as I do in my samples on the next page).
For the separate chaining hash table, use $\alpha = 3.0$ as your threshold. Start with a table of size 5 and
resize to 11 if necessary.
To compute the hash index, just use $k \mod M$ where $k$ is the number being inserted.
If you need to resize a table, do so before adding the item that would put it over the threshold, and
show both tables.
The following pages show the result of doing this exercise with these numbers:
62 91 12 44 64 47 85 39 18 41 74 21 54 14 97 86
Here is an example on how it should be done!
SEPARATE CHAINING
LINEAR PRODING
