______ is a collision-resolution scheme that searches the hash table for an unoccupied location beginning with the original location that the hash function specifies and continuing at increments of 12,22,32,and so on.
A)Linear probing
B)Double hashing
C)Quadratic probing
D)Separate chaining

Question

Quizplus · Accepted Answer

This collision-resolution scheme described is quadratic probing. Linear probing searches for the next available location in a consecutive manner, double hashing uses a secondary hash function to determine an alternate location, and separate chaining uses linked lists to store multiple values at the same location. Therefore, only option C) is the correct choice.

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