Java Problem 1:

a.Using a fixed size array of size 17 insert the following numbers into the table using number % table size as the hashing function. Use open Addressing to resolve collisions.

10, 20, 30, 40, 50, 60, 70, 80, 90

b.Using a fixed size array of size 17 insert the following numbers into the table using number % table size as the hashing function.

11, 23, 31, 43, 53, 61, 79, 89, 97

c.Is there a difference in the collision rates for a and b above?

No need coding. Just need to solve the problems either on paper or in a digital document.

Thanks.