Question: Using closed hashing, with double hashing to resolve collisions, insert the following keys into a hash table of thirteen slots (the slots are numbered 0
Using closed hashing, with double hashing to resolve collisions, insert the following keys into a hash table of thirteen slots (the slots are numbered 0 through 12). The hash functions to be used are H1 and H2, defined below.
You should show the hash table after all eight keys have been inserted.
Be sure to indicate how you are using H1 and H2 to do the hashing. Function Rev(k) reverses the decimal digits of k, for example, Rev(37) = 73;
Rev(7) = 7.
H1(k) = k mod 13.
H2(k) = (Rev(k + 1) mod 11).
Keys: 2, 8, 31, 20, 19, 18, 53, 27.
Step by Step Solution
3.25 Rating (157 Votes )
There are 3 Steps involved in it
Alright lets go over how closed hashing also known as open addressing works In closed hashing if a data element hashes to a location that is already o... View full answer
Get step-by-step solutions from verified subject matter experts
