The next structure you will investigate is the Hash table and its methods implemented in pseudo code when linked lists are used to handle collisions.
The task this week is to complete the pseudo code for the following hash table operations:
Assume Hashtable is a simple array of size 8, with indices 0..7. Numeric keys are mapped by a Hashfunction that gives the mod(8,n) value for any key “n” yielding the Hashtable index for that key (0..7). A Hashtable entry is null unless a key exists with that index as its hashed index; if so, the Hashtable entry points to the first node of a linked list of keys with that hash index. The last node on this linked list has a null reference for the next referenced node. Assume the occurrence of a linked list node is represented by the object “Node” and its “Data” and “NextRef” attributes.
Week 2 Deliverables:
•1 pseudo code implementation of each Hash table operation: Insert and Remove
•Fully documented pseudo code.
•Add the completed pseudo code and the output to the Key Assignment template Section 2: Hashing, Heaps and Trees.
•Name the document “IT265__IP2.doc.”