Question

What are ALL the properties of a hash function that maps all inputs to number 5

A.transitive
B.equality preserving
C.efficient
D.good choice to use with a hashtable

Answer 1

transitive is right answer

Answer 2

The HashMap provides constant time complexity for basic operations, get and put if the hash operate is properly written and it disperses the weather properly among the buckets.

Explanation:

• The HashMap provides constant time complexity for basic operations, get and put if the hash operate is properly written and it disperses the weather properly among the buckets.

• Iteration over HashMap depends on the capacity of HashMap and the variety of key-value pairs. Basically, it is directly proportional to the capacity + size.

• Hash tables are typically used to implement associative arrays, sets, and caches.

• Like arrays, hash tables provide constant-time O(1) search on average, regardless of the number of things within the table.

• Compared to other associative array information structures, hash tables are most helpful once we have a tendency to ought to store an outsized variety of knowledge records.