Q18_85_20250728130312.webp

☑Kizspy.me
(Choose 1 answer)
☐ A
Given a 11-entry hash table and a hash function, h(i)=(3i+5) mod 11, to hash the keys 2, 12, 15, and 1,
assuming no collision is handled. Where is 1 hashed?
Back
Next
FUQ.sh
sh the exam.
A. 1
B. 2
C. 8
D. collision