Problem 5:

Consider inserting keys 10,19,28,0,1,2,37 into a hash table of length m = 9 using open addressing with the auxiliary hash function h' (k) = k mod m. (mod is the % operation of C/C++/Java.) Illustrate the result of inserting these keys using quadratic probing with hash function h(k, i) = (h' (k)+i ^2 ) mod m. How many collisions did they occur ?

Please explain the logic.

Problem 5. (20 POINTS) Consider inserting keys 10,19,28,0, 1,237 into a hash table of length m = 9 using open addressing with the auxiliary hash function h,(k) = k mod m. (mod is the % operation of C/C++/Java.) Illustrate the result of inserting these keys using quadratic probing with hash function h(k, i) = (h'(k)+*) mod m. How many collisions did they occur? 0 2