Question

In open addressing, if a collision occurs and the hash function h(key) maps to an occupied slot, which probing technique attempts to find the next available slot by checking (h(key) + i^2) % table_size for increasing values of i?

A Linear Probing
B Quadratic Probing
C Double Hashing
D Separate Chaining
E Coalesced Hashing
Practice Next

Hey! Ask a query