In a double hashing scheme, h1(k) = k mod 11 and h2(k) = 1 + (k mod 7) are the auxiliary hash functions. The size of the...

Question

In a double hashing scheme, h1(k) = k mod 11 and h2(k) = 1 + (k mod 7) are the auxiliary hash functions. The size of the hash table is 11. The hash function for the i-th probe in the open address table is h(k, i) = (h1(k) + i * h2(k)) mod 11. The following keys are inserted in the given order: 24, 50, 70, 75, 9, 2. The slot at which key 24 gets stored is ___________ (Answer in integer)

Accepted Answer

Key 24 is stored at slot 2. We have a hash table of size 11 (slots 0 to 10) using double hashing for collision resolution. Keys are inserted one by one. When key 24 is inserted first, we compute its primary hash h1(24) = 24 mod 11 = 2. Since the table is initially empty, slot 2 is free and key 24 is stored there at slot 2.