Question: Which of the following hash functions is considered good for a hash table?

Options:

1. A function that always returns the same index
2. A function that distributes keys uniformly across the table
3. A function that uses only the first character of the key
4. A function that is computationally expensive

Correct Answer: A function that distributes keys uniformly across the table

Solution:

A good hash function distributes keys uniformly across the hash table to minimize collisions and ensure efficient access.