(Choose 1 answer)
0
0
0
0 203
Given the division hash function h(x) = x%M, where M = 10 and Collision Resolution is quadratic probing. i.e. when inserting a key x, the collision is
1
1
1
1
resolved by finding an available position at (h(x) + i^2)%M). i=1, 2.How the hash table looks like after inserting the following keys sequentially?
2
2
2
2
3
63
3
63
3
63
3
63
63, 74, 94, 203
4
74
4
74
4
74
4
74
5
94
5
5
94
5
A. (1)
6
6 94
6
203
6
B. (2)
7
203
7
203
7
7
94
C. (4)
8
8
8
8
D. (3)
9
9
9
9
(1)
(2)
(3)
(4)
FUO
