☑Kizspy.me
(Choose 1 answer)
☐ A
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 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?
65. 76, 96, 205
...
A. (1)
Back
Next
B. (4)
C. (3)
D. (2)
FUO.sh
sh the exam.
0
0 205
1
205
1
2
2
3
3456789
56
65
76
96
0123
0
1
23456789
65
76
96
4
5678
6
65
76
96
205
456789
(1)
(2)
65
76
96
205
(3)
(4)
