Which problem is most closely associated with linear probing in open-addressing hash tables?
Correct answer C. Primary clustering
Explanation
With linear probing, any key that hashes into a run of occupied slots ends up at the end of that run, lengthening it, so long contiguous clusters form and probe sequences grow. This is primary clustering. Quadratic probing and double hashing spread probes out to reduce it. Starvation and thrashing are operating-system scheduling and memory terms, not hashing issues.
Answer checked How we write and check questions
Discussion