Question

Which of the following trait of a hash function is most desirable?

(a) it should cause less collisions

(b) it should cause more collisions

(c) it should occupy less space

(d) it should be easy to implement

Query is from Hash Tables topic in portion Hash Tables of Data Structures & Algorithms I

I got this question in an internship interview.

Answer 1

Correct option is (a) it should cause less collisions

The best I can explain: Hash function calculates and returns the index for corresponding data. So the most important trait of a hash function is that it should cause a minimum number of collisions.