+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is simple uniform hashing?

(a) Every element has equal probability of hashing into any of the slots

(b) A weighted probabilistic method is used to hash elements into the slots

(c) Elements has Random probability of hashing into array slots

(d) Elements are hashed based on priority

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

This question was addressed to me by my college professor while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct answer is (a) Every element has equal probability of hashing into any of the slots

To explain: In simple uniform hashing, any given element is equally likely to hash into any of the slots available in the array.

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.

Categories

...