A hash table contains 10 buckets and uses linear probing. Hash function: key %…
A hash table contains 10 buckets and uses linear probing. Hash function: key % 10. Insert keys: 43, 165, 62, 123, 142. Where will 142 be inserted? (Assume table size = 8?)
- A.
2
- B.
3
- C.
4
- D.
6
Attempted by 703 students.
Sign up free to check your answer
Sign up freeLoading lesson…

