GATE | CS | 2015 | Set 2 | Data Structures | Hashing | Question 10

Last Updated :
Discuss
Comments

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?
 

h(i) = (12 ∗ i) mod 10
 

h(i) = (11 ∗ i2) mod 10
 

h(i) =i3 mod 10
 

h(i) =i2 mod 10 
 

Share your thoughts in the comments