+1 vote
in Data Structures & Algorithms I by (88.2k points)
Collisions can be reduced by choosing a hash function randomly in a way that is independent of the keys that are actually to be stored.

(a) True

(b) False

I would like to ask this question from Hash Tables topic in section Hash Tables of Data Structures & Algorithms I

The question was posed to me during an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) True

Explanation: Because of randomization, the algorithm can behave differently on each execution, providing good average case performance for any input.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.