Question

Assume you are given a separate chaining hashtable where M=11. Give the final hashtable after adding keys: 24, 1, 4, 11, 12, 22, 33, 45, 8, 19, and 10. Use the hash function hash(k) = k mod 11, where k is the key. Include the main size M array with lists located at each index. Only include the key, not the hashed value, in your final table. Your table should look similar to the one below.

Index	List
0	[Key1, Key2]
1	[]
2	[Key3]

Answer 1

k     h(k)
------------
24      2
1       1
4       4
11      0
12      1
22      0
33      0
45      1
8       8
19      8
10      10
------------


Hash table:
--------------------------------
Index       List
0           [11, 22, 33]
1           [1, 12, 45]
2           [24]
3           [ ]
4           [4]
5           [ ]
6           [ ]
7           [ ]
8           [8, 19]
9           [ ]
10          [10]