Consider a hash table of size N=7 where we are going to store entries with integer
key values. The hash function is
h(x)=x,mod7
Draw the resulting table after inserting entries, in the given order, with the following
key values: 5, 15, 12, 26, 11 .
(1) Assume that collisions are handled by separate chaining.
(2) Assuming collisions are handled by linear probing.
(3) Assuming collisions are handled by double hashing, using secondary hash
function
h^(')(x)=5-([x,mod5])
Consider a hash table of size N = 7 where we are going to store entries with integer key values. The hash function is
h(x) =x mod 7
Draw the resulting table after inserting entries, in the given order, with the following key values: 5, 15, 12, 26, 11.
(1) Assume that collisions are handled by separate chaining
(2) Assuming collisions are handled by linear probing.
(3) Assuming collisions are handled by double hashing, using secondary hash
function
h'(x)=5-(x
mod 5)