Question

11. (10 Points) Draw the final result after inserting keys 24, 25, 50, 38, 12, 90 into a hash table with collisions resolved by (a) linear probing, (b) chaining. Let the table have 13 slots with addresses starting at 0, and let the hash function be h(k) k mod 13 (a) (5 Points) Linear Probing 0 1 2 3 4 5 6 789 10 11 12 [ANSWER] (b) (5 Points) Separate Chaining ANSWER]

Answer 1

24 % 13 = 11
25 % 13 = 12
50 % 13 = 11
38 % 13 = 12
12 % 13 = 12
90 % 13 = 12

Linear probing:
-----------------
0   ->  50
1   ->  38
2   ->  12
3   ->  90
4   ->
5   ->
6   ->
7   ->
8   ->
9   ->
10  ->
11  ->  24
12  ->  25

Separate Chaining:
-------------------
0   ->
1   ->
2   ->
3   ->
4   ->
5   ->
6   ->
7   ->
8   ->
9   ->
10  ->
11  ->  24  ->  50
12  ->  25  ->  38  ->  12  ->  90