CS 240: Algorithms and Data Structures
James Madison University, Fall 2021

Starter Code

Put and Get

Implement the put and get method using closed hashing with linear probing.


Modify your put method and implement rehash so that the load factor remains below MAX_LOAD.


Implement the remove method. Note that removal should not actually remove the indicated item from the hash table. Instead it should set the tombstone flag to true. You will also need to modify your get and put methods make appropriate use of the flag.


Submit HashTable.java through Autolab.