In a hash table, which of the following is used to resolve collisions ?

2025

In a hash table, which of the following is used to resolve collisions ?

  1. A.

    Hashing

  2. B.

    Chaining

  3. C.

    Backtracking

  4. D.

    Sorting

Attempted by 88 students.

Show answer & explanation

Correct answer: B

Hash table collisions are resolved using techniques like Chaining or Open Addressing. Chaining stores multiple elements at the same index in a linked list, while Open Addressing finds another empty slot within the table.

Explore the full course: Niacl Ao It Specialist