In which collision-avoidance hashing strategy are the items stored in an array of linked lists in which each item's key locates the bucket where the item is to be inserted?
A) clustering
B) chaining
C) quadratic probing
D) linear probing

Question

Quizplus · Accepted Answer

This describes the chaining collision avoidance hashing strategy. The items are stored in an array, and if two items hash to the same index, they are stored in a linked list at that index. This approach can handle large numbers of collisions effectively and has relatively low computational overhead.

In Which Collision-Avoidance Hashing Strategy Are the Items Stored in an Array