+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which hash function satisfies the condition of simple uniform hashing?

(a) h(k) = lowerbound(km)

(b) h(k)= upperbound(mk)

(c) h(k)= lowerbound(k)

(d) h(k)= upperbound(k)

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

I got this question during an interview.

1 Answer

0 votes
by (88.2k points)
selected by
Best answer

correct option is: (a) h(k) = lowerbound(km)

If the keys are known to be random real numbers k independently and uniformly distributed in the range 0<=k<=1, the hash function which satisfies the condition of simple uniform hashing is

h(k)= lowerbound(km).

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.