______ is a collision-resolution scheme that searches the hash table sequentially,starting from the original location specified by the hash function,for an unoccupied location.
A)Linear probing
B)Quadratic probing
C)Double hashing
D)Separate chaining

Question

Quizplus · Accepted Answer

Linear probing is a collision-resolution scheme that sequentially searches the hash table starting from the original location specified by the hash function. It checks each subsequent location until an unoccupied location is found. This is a simple and easy-to-implement technique that does not require additional data structures. However, linear probing can suffer from clustering, where groups of adjacent locations become occupied, leading to longer search times. Nonetheless, it is still an effective and commonly used method for resolving collisions in hash tables.

______ Is a Collision-Resolution Scheme That Searches the Hash Table