Assume an initially empty hash table with 11 entries in


Show the contents of the hash table from Exercise 11.1 after rehashing with a new table containing 19 entries.

Exercise 11.1:

Assume an initially empty hash table with 11 entries in which the hash function uses the division method. Show the contents of the hash table after the following keys are inserted (in the order listed), assuming the indicated type of probe is used: 67, 815, 45, 39, 2, 901, 34.

(a) linear probe (with c = 1)

(b) linear probe (with c = 3)

(c) quadratic probe

(d) double hashing [with hp(key) = (key ∗ 3) % 7]

(e) separate chaining

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Assume an initially empty hash table with 11 entries in
Reference No:- TGS01715369

Expected delivery within 24 Hours