題組內容

3. (10%) A hash table has 11 buckets. Given the following numbers as keys: 77, 10, 33, 83, 121, 7, 55, 42, 22, 19, 59, 132 and a hashing function h(k) = k mod 11.

(a) (5%) Use linear probing to handle the overflow (draw the hash table).