assignment

The task this week is to complete the pseudo code for the following hash table operations:

1. Insert
2. Remove

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

The answer will be pseudocode in English. The code i pasted is what i submitted before but the lecturer wants the pseudocode to be in plain English. so i am not expecting a java code. Can you do that. i have 25 dollars