C Sc 227 Assignment: Separately Chained Hashtable

C Sc 227 Assignment: Separately Chained HashTable

Complete HashTable<K,V so it implements the Map ADT with the following methods:

public V put(Kkey, Vvalue)

associates key to value and stores this mapping

public V get(K key)

return the value to which key is mapped or null

public boolean containsKey(K key)

returns true if the Map already uses the key

public V remove(K key)

returns previous value associated with specified key, or null if there was no mapping for key.

Collection<V> values()

get a collection you can iterate over with iterators

Grading Criteria:

___/ +30pts via WebCat turnin, includes tests and code coverage

-20 If not using separate chaining hashing with an array of LinkedList objects