Question

Data Structure

Please Just the Ansewr No Need More Explanation

Question 4 4 pts Mark all that apply by writing either T (for true) or F (for false) in the blank box before each statement. Regarding hash maps: A hash table relies on random access to an array to get rapid access to entries. A hash function creates an integer bucket ID from the key and uses it to index into the array Equal objects must always have the same hash value. A hash function must map keys to integers as evenly as possible.

Answer 1

Regarding Hashmaps(True/False):

1. True, a hash table relies on random access to an array to get rapid access to entries.

2. True, a hash function creates an integer bucket id and uses it to index into the array.

3. True, an object's hashCode method must take the same fields into account as its equals method. By overriding the equals method.

4. True, a hash function must map keys to integers as evenly as possible.