1. Hash In-Class Quiz

2. Consider inserting the keys 59, 10, 31, 88, 22, 4, 68, 28, 15, 34, 17 into a hash table of size m = 11 using open addressing with linear probing with the hash function h(k) = k mod m Which filling in of the hash table below (indexing from 0 through 10) will result?

3. Solutions Quadratic probing Linear probing
Random probing with probe sequence:
Double hashing with hash function: h(k) = (k mod 11 + i (1 + (k mod 8))) mod 11