Task 4 Chaining based collision resolution technique.

In chaining based collision resolution technique, the keys generating

same hash value are placed in same bucket using pointers.

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?

1. h (i) = i² mod 10

2. h (i) = i³ mod 10

3. h (i) = (11i²) mod 10

4. h (i) = (12i) mod 10