When a hashing algorithm produces an address for an insertion key and that address is already occupied, it is called a _______.
A) collision
B) probe
C) synonym
D) linked list

Question

Quizplus · Accepted Answer

A collision occurs when a hashing algorithm produces an address for an insertion key and that address is already occupied by another key/value pair. This can happen due to the limited size of the hash table or the nature of the hash function. To resolve collisions, various techniques can be used such as open addressing, chaining, or linear probing.

When a Hashing Algorithm Produces an Address for an Insertion