Hashing in Data Structure Assignment

Assignment Task

Time for another Hash Table implementation! This one is a bit different. We go back to having a single key, but rather than resolving collisions with probing, we resolve collisions by simply making more hash tables with new hash functions

Your hash function will now use an instance variable called level. key is as it was before - the key is inserted into the table. level specifies what level of the hash table hierarchy we are hashing for. This will become more obvious with a worked example. You can assume that all keys that go into this table are strings of lowercase English letters.

This IT and Computer Science has been solved by our PHD Experts at My Uni Papers.