Experiment with hashCode() in Java on a large dataset (of size M) to show that the hash functions distribute keys fairly evenly between 0 to M-1.

All the values were thrown into the same hash bucket, therefore the hash map isn't particularly good (that is, they are all in the same LinkedList). If this is the case, please elaborate on how using a hash map in the first place will be rendered ineffective.

We're dealing with a bad hash map in which all of the values are stored in the same container (that is, they are all in the same LinkedList). The purpose of a hash map has been completed.

We have a crude hash map where all values are concatenated into a single bucket (that is, they are all in the same LinkedList). A hash map's goal has been accomplished.

We're dealing with a bad hash map in which all of the values are stored in the same container (that is, they are all in the same LinkedList). The purpose of a hash map has been completed.

Is the number of linked lists included inside an m-dimensional hash table always the same? I can't for the life of me figure out what a hash function is for. Give an example to back up your point.

Suppose you have a hash table with seven entries (indexed 0 through 6). This table uses open addressing with the hash function that maps each letter to its alphabet code (a = A = 0, etc.) modulo 7. Rehashing is accomplished using linear-probing with a jump of 1. Describe the state of the table after each of the letters D, a, d, H, a, and h are added to the table.

In this case, we have a hash map that was not constructed with a lot of care since all of the values have been lumped together (that is, they are all in the same LinkedList). In your own words, please elaborate on why this undermines the use of a hash map.

The values have been placed in a single pool, resulting in a hash map that was constructed carelessly (they are all in the same LinkedList). Explain why this is inefficient in comparison to using a hash map.

We have a badly built hash map in which all of the stored values are in the same bucket (that is, they are all in the same LinkedList). Explain why this negates the benefits of a hash map.