Assume that we want to store seven values in a thirteen element vector using a hash function. For the value of x the hash function is: f(x)=(abs((x2 -3x+6))%13 abs is an absolute value function If a collision occurs the value should be placed in the next available location in ascending order. If an attempt to store a value in the last location (position 12) fails, wrap around to the beginning of the vector. For each of the following values in what location will the first attempt be made to store the value without respect to collisions?
a. 3
b. 7
c. 8
d. 4
e. 2
f. 9
g. 6
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here