8888
☑Kizspy.me
(Choose 1 answer)
Given the division hash function h(x) = x%M.
0
35
0
1
1
where M 10 and Collision Resolution
is quadratic probing. i.e. when inserting a key x.
2
2
the collision is resolved by finding an available
position at (h(x)+ i^2)%M). i=1, 2,
3
3
How the hash table looks like after inserting the
following keys sequentially?
25, 96, 35, 105
A. (1)
B. (4)
Back
Next
C. (2)
D. (3)
456789
105
4
105
25
96
56789
25
96
35
0123456789
25
96
35
105
0123456789
105
25
96
35
(1)
(2)
(3)
(4)
FUQ.sh
sh the exam.
