Question

What is the best definition of a collision in a hash table?

(a) Two entries are identical except for their keys

(b) Two entries with different data have the exact same key

(c) Two entries with different keys have the same exact hash value

(d) Two entries with the exact same key have different hash values

I got this question during an online interview.

This key question is from Hashing techniques in division Indexing and Hashing of Database Management

Answer 1

Correct answer is (a) Two entries are identical except for their keys

Best explanation: This level is the root of the tree.