☑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?
64, 75, 95, 204
A. (2)
B. (1)
Back
Next
C. (4)
D. (3)
234
64
75
56
95
7
204
8
0123456789
0
0
1
1
2
64
75
95
204
3456789
64
75
95
204
012345678a
64
75
95
9
9 204
(1)
(2)
(3)
(4)
sh the exam.
LAPTOP RUNNING
0
