Data Structures

Which of the following best names the concept in which a collision resolution technique in hashing that searches sequentially for the next open slot in the table?

Correct answer

A. Linear probing

Explanation

Linear probing refers to a collision resolution technique in hashing that searches sequentially for the next open slot in the table.