Blog

This question uses the same environment as given in Question…

This question uses the same environment as given in Question #2.  However, for this question using double hashing as the collision resolution strategy with the following hash functions: h1 (x) = x mod 13 and  h2 (x) = 5 – (x mod 5) Create a table just like was done for Question #2.

Insert the keys: 34, 19, 47, 23, 58, 52, 74 and 86 into a ha…

Insert the keys: 34, 19, 47, 23, 58, 52, 74 and 86 into a hash table of size 13 with the hash function h1 (x) = x mod 13 and using linear probing to resolve collisions. Create a table showing the index positions and the keys which have been inserted into the table.  See the example table below:   A M index 0 1 2 3