11 "h(k) = k mod " + arrSize probeCommon.initJSAV("HashDoublePPRO", arrSize) probeCommon.getH1(probeCommon.currentKey) probeCommon.getH2(probeCommon.currentKey)

Given the following hash table, use hash function hashFunction and handle collisions using Double Hashing with probe function p(K, i) = i*h2(K), and h2(K) = 1 + (k % 10).

In which slot should the record with key value probeCommon.currentKey be inserted?

h1(probeCommon.currentKey) = H1.

h2(probeCommon.currentKey) = H2.

[probeCommon.userInput]
if (!probeCommon.checkAnswer(arrSize) && !guess[0]) { return ""; // User did not click, and correct answer is not // initial array state } else { return probeCommon.checkAnswer(arrSize); }

First, we hash to the home slot with the first hash function.

If there is a collistion, then we use the second hash function to compute a stepsize.

We then use linear probing by the computed step size.