Question

Which of the following is true about a good hash function?

• A. It always produces the same hash value for different keys.
• B. It distributes keys uniformly across the hash table.
• C. It always results in hash collisions.
• D. It requires storing all keys in contiguous memory locations.

Hint:

A perfect hash function (one with zero collisions) is rarely possible in practice. Thus, a "good" function focuses on "Simple Uniform Hashing," where any given key is equally likely to hash into any of the $m$ slots.

Answer 1

The Correct Option is B