A hash table has 10 slots and uses the hash function: f(key) = key mod 10…
A hash table has 10 slots and uses the hash function:
f(key) = key mod 10
Assume linear probing is used to resolve collisions. If the keys 125, 107, 74, 56, 30, 188, 33, 589 are inserted in that order, at which slot will the key 878 be placed?
- A.
1
- B.
0
- C.
2
- D.
3
Attempted by 368 students.
Sign up free to check your answer
Sign up freeLoading lesson…

