Which technique allows a hash table to handle collisions by storing multiple items at a single bucket?

Which technique allows a hash table to handle collisions by storing multiple items at a single bucket?

• A. Open addressing
• B. Chaining
• C. Linear probing
• D. Double hashing

Answer: (B)

Storing multiple items in a single bucket is achieved with chaining. Each bucket keeps its own list (such as a linked list) of all entries that hash to that index. When a new key hashes to a bucket that’s already in use, it’s simply added to that bucket’s chain. This lets many items share the same bucket without moving them to other buckets. The other methods resolve collisions by placing the colliding item in a different bucket within the table (open addressing). Techniques like linear probing and double hashing search for the next available slot according to a probing rule or a second hash function, rather than storing multiple items in one bucket.

Storing multiple items in a single bucket is achieved with chaining. Each bucket keeps its own list (such as a linked list) of all entries that hash to that index. When a new key hashes to a bucket that’s already in use, it’s simply added to that bucket’s chain. This lets many items share the same bucket without moving them to other buckets.

The other methods resolve collisions by placing the colliding item in a different bucket within the table (open addressing). Techniques like linear probing and double hashing search for the next available slot according to a probing rule or a second hash function, rather than storing multiple items in one bucket.