Hash function is h(k)= k % 16 (use 4 binary bits to represent result). 1-1,2 keys/bucket...

Transcribed Image Text:

Hash function is h(k)= k % 16 (use 4 binary bits to represent result). 1-1,2 keys/bucket Expand policy: whenever there is no room for the current insertion, use or add an overflow bucket for the inserted item, then increase m by 1, and increase i if necessary. If the item is inserted into an overflow bucket, also increase m by 1 after insertion. 6 9 0 1 m=0 (max used block) Insert the following keys one by one and show the index structure after each insertion. a. 10 b. 18 c. 33 d. 25 Hash function is h(k)= k % 16 (use 4 binary bits to represent result). 1-1,2 keys/bucket Expand policy: whenever there is no room for the current insertion, use or add an overflow bucket for the inserted item, then increase m by 1, and increase i if necessary. If the item is inserted into an overflow bucket, also increase m by 1 after insertion. 6 9 0 1 m=0 (max used block) Insert the following keys one by one and show the index structure after each insertion. a. 10 b. 18 c. 33 d. 25