Question

What is the formula used in quadratic probing?

(a) Hash key = key mod table size

(b) Hash key=(hash(x)+F(i)) mod table size

(c) Hash key=(hash(x)+F(i^2)) mod table size

(d) H(x) = x mod 17

The above asked question is from Hash Tables topic in portion Hash Tables of Data Structures & Algorithms I

I had been asked this question during an online exam.

Answer 1

Right answer is (c) Hash key=(hash(x)+F(i^2)) mod table size

Explanation: Hash key=(hash(x)+F(i^2)) mod table size is the formula for quadratic probing. Hash key = (hash(x)+F(i)) mod table size is the formula for linear probing.