Professional Academic Writing Service
  • 100% Original Essays Guaranteed
  • Original and creative work
  • Timely delivery guaranteed
  • 100% confidentiality guarantee
  • 100% plagiarism FREE
  • Fully referenced
  • Any citation style
  • FREE amendments
Get an

Hash table and its methods implemented in pseudo code

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:

  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.




Is this your assignment or some part of it?
We can do it for you! Click to Order!

Order Now

Free Turnitin Reports

Our Benefits

  • 100% plagiarism FREE
  • Guaranteed Privacy
  • FREE bibliography page
  • Fully referenced
  • Any citation style
  • 275 words per page
  • FREE amendments
Translate »

You cannot copy content of this page