One way to handle collisions in a hash table is a method called separate chaining.What does separate chaining do?
A)Colliding elements are collected in a list of elements with the same position value
B)A "bucket" is used to hold the collided hash codes and redistribute new hash codes
C)Colliding elements are place in empty locations of the hash table
D)When two elements collide, only the most recently inserted element is kept

Question

Quizplus · Accepted Answer

Separate chaining is a collision resolution technique in which colliding elements are stored in a linked list at the same position in the hash table. This way, multiple keys can be stored at the same index and the lookup and insertion time does not depend on the number of elements in the table.

One Way to Handle Collisions in a Hash Table Is