← Quiz: How Hashing Works: all 13 questions
Quiz: How Hashing Works · Question 2 of 13
What is a collision in a hash table?
What is a collision in a hash table?
- A.Two equal keys stored twice
- B.Two different keys mapped to the same bucket
- C.The table running out of memory
- D.A key that has no hash code
Answer & explanation
Correct answer: Two different keys mapped to the same bucket
Different keys can produce the same bucket index; the table must store both.
Can you get the rest right without peeking?
Take the timed Quiz: How Hashing Works quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →