Question

Specify the correct statement about chainina method for handling collision

A. In chaining, the linked-listis used instead of array for a hash table
B. In chaining, some positions of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys
C. In this method, the table can never overflow if free memory is available, because the linked listis extendible.
D. None of others

Answer 1

The correct statement about the chaining method for collision resolution in hash tables is that it associates indices with linked lists and can handle an unlimited number of collisions as long as memory is available.

Step-by-step explanation:

The correct statement about the chaining method for handling collisions in a hash table is: In chaining, some positions of the table are associated with a linked list or chain of structures whose info fields store keys or references to keys. When a collision occurs, the key is added to the linked list at the position given by the hash function. Thus, option B is the correct choice because chaining involves appending collided elements to a list corresponding to the hashed index. Furthermore, option C is also correct as the table can indeed never overflow as long as there is free memory since linked lists are extendable. Hence, this method elegantly handles collisions and dynamic insertion of keys.