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.