Task: Implementation of the ProbeHashTable class with linear probing. The templa

Question

Task: Implementation of the ProbeHashTable class with linear probing.
The template of ProbeHashTable class and relevant classes are given below:

Requirements:

Implement the ProbeHashMap class using pseudocodes above.

Your implementation has to follow the specification given. Any other implementation will not be accepted. Please use and ONLY use the skeletons provided.

Test: write a test program to create a hash table with the default size. of two classes in the number of collisions (returned by both put() methods). Insert 100 data items (random strings) and then remove 10 of them. Finally, please print out the remaining items in the hash table. Note that your implementation will be evaluated by a specific test program.

Need answer with source codes LPHashTable.java, DHHashTable.java and Test.java.

Explanation / Answer

import java.io.*; class StringDataItem { private String sData; public StringDataItem(String ss) { sData = ss; } public String getKey() { return sData; } } class StringHashTable { private StringDataItem[] hashArray; private int arraySize; private StringDataItem nonItem; public StringHashTable(int size) { arraySize = size; hashArray = new StringDataItem[arraySize]; nonItem = new StringDataItem("-"); //deleted item key is a dash for(int i = 0; i

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---