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

public class ProbeHashTable extends AbstractHashMap { private MapEntry[] table; private MapEntry DEFUNCT = new MapEntry(null,null); //constructors protected void createTable() { // your implementation here } private boolean isAvailable(int i) { // your implementation here } private int findSlot(int h, String k) { // your implementation here } protected Object bucketPut(int h, Object key, Object value) { // your implementation here } protected Object bucketGet(int h, Object key) { // your implementation here } protected Object bucketRemove(int h, Object key) { // your implementation here } public String toString() { // convert the ProbeHashTable object to a string in the format of // "index key value" tuples, for example // 0 CSU OHIO // 1 CLE PIT // 2 PLAY HOUSE } } 

public class MapEntry { private String key; private String value; // constructor public String getKey() {return key;} public String getValue() {return value;} public int hashCode() { int h = 0; for (int i=0; i>>27); h += (int)key.charAt(i); } return h; } } 

public abstract class AbstractHashMap extends AbstractMap { protected int n = 0; // the number of entries protected int capacity; // size of the map private int prime; // the prime number private long scale, offset; // a = scale, b = offset public AbstractHashMap() { capacity = 199; prime = 999331; Random rand = new Random(); scale = rand.nextInt(prime-1) + 1; offset = rand.nextInt(prime); createTable(); } public AbstractHashMap(int c, int p, long scale, long off) { this.capacity = c; this.prime = p; this.scale = scale; this.offset = off; createTable(); } public int size() {return n;} public boolean isEmpty() {return n == 0;} public int hashValue(Object key) { return (int) ((Math.abs(key.hashCode()*scale+offset)%prime)%capacity); } public Object get(Object key) { int h = hashValue(key); return bucketGet(h, key); } public Object remove(Object key) { int h = hashValue(key); return bucketRemove(h, key); } public Object put(Object key, Object value) { int h = hashValue(key); return bucketPut(h, key, value); } protected abstract void createTable(); protected abstract Object bucketGet(int h, Object k); protected abstract Object bucketRemove(int h, Object k); protected abstract Object bucketPut(int h, Object k, Object v); } 

public abstract class AbstractMap { public Object get(Object key); public Object remove(Object key); public Object put(Object key, Object value); public int size(); public boolean isEmpty(); } 

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.