What is a collision in a hash table implementation of a symbol table? Choose the most appropriate one.
A. Two key-value pairs that have equal keys but different values.
B. Two key-value pairs that have different keys and hash to different indices.
C. Two key-value pairs that have different keys but hash to the same index.
D. Two key-value pairs that have equal keys but hash to different indices.
Answer:C
What is a collision in a hash table implementation of a symbol table? Choose the most appropriate one.
A. Two key-value pairs that have equal keys but different values. B. Two key-value pairs that have different keys and hash to different indices. C. Two key-value pairs that have different keys but hash to the same index. D. Two key-value pairs that have equal keys but hash to different indices.