Computer Sciences > GATE 2015 SET-2 > Hashing
Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for i ranging from 0 to 2020?
A
h(i) = i2 mod 10
B
h(i) = i3 mod 10
C
h(i) = (11 * i2) mod 10
D
h(i) = (12 * i) mod 10

Correct : b

Similar Questions

Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) = 1+(k mod 19). Assume that th...
#647 Fill in the Blanks
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order...
#1211 MCQ
Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots ar...
#1314 MCQ

Related Topics

hash function uniform distribution GATE computer science 2015 hash function integers modulo operation integer hashing quadratic residue cubic residue linear probing collision resolution techniques

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: