Which technique stores multiple collided elements in a linked list at the same hash index?

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)

B. Separate chaining

Detailed Explanation

Separate chaining is a collision-resolution technique in which each hash-table index maintains a collection, commonly a linked list, containing elements that map to that index. If several keys produce the same hash value, they can be stored in the same chain. Searching then involves examining the chain associated with the calculated index. The performance depends on the number of collisions and the load factor. Some implementations use balanced trees instead of linked lists for improved worst-case behavior.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts