Gate CS-2015-2 Question Paper With Solutions

Q. 55 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

Answer: (B)

Explanation:

Gate CS-2015-2 Question Paper With Solutions

Learn More:   Gate EC-2014 - 1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here