Which collision resolution technique checks the next available position sequentially?

Options

  • A. Linear probing
  • B. Separate chaining
  • C. Binary search
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. Linear probing

Detailed Explanation

Linear probing is an open-addressing collision-resolution technique. When the calculated hash position is occupied, the algorithm checks subsequent positions sequentially until an available position is found. For example, positions can be examined using a sequence such as h(k), h(k)+1, h(k)+2, and so on, usually with wraparound. A major disadvantage is primary clustering, where groups of occupied consecutive positions develop and can increase the search time.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts