Homework 7
due Mon 2/12 in class

Perform the following operations on a hashtable of size 11 under each of the scenarios listed, showing the contents of the hashtable after each step: insert 5, insert 16, insert 22, insert 45, insert 33, insert 2, insert 56, insert 10, delete 22, delete 33, insert 20, insert 32, insert 50, insert 12, delete 2, delete 56, insert 47

1. • separate chaining, using hash function v%11
   • linear probing, using hash function v%11

2. • quadratic probing, using hash function v%11
   • double hashing, using hash function v%11 and secondary hash function 7-v%7