Question

Extendible Hashing. Suppose that we are using extendible hashing to insert, to an originally empty file, records with the following search-key values: 50,44,25,20,37,7,51,49, 18, 69 in the exact order. Let the hash function be f(z) = (z mod 7) and assume that each bucket can hold up to three records. Show the extendible hashing structure after the insertion of 37,7,69, respectively. Note: x mod y is the remainder of an integer division z÷y. For example, 11 mod 4 = 3.

Answer 1

Since the hash function is f(x) = x mod 7, so the index of hash table will range from 0 to 6.

We will insert the element into hash table now, while making sure that no bucket holds more than 3 records.

Below is the hash table after inserting upto 37, 7

Index	Content
0	7
1	50
2	44 , 37
3
4	25
5
6	20

Now let us insert remaining elements, and see the final hash table.

Index	Content
0	7 , 49
1	50
2	44, 37, 51
3
4	25 , 18
5
6	20, 69

Please comment for any clarification.