Discussion
In a hash table, which of the following is used to resolve collisions ?
Answer: B
Collisions are resolved by Chaining.
In separate chaining, each slot of the hash table holds a linked list (chain) of all keys that hash to it, so colliding keys are stored side by side. Open addressing (linear or quadratic probing) is the other main method.
Hashing is what causes collisions, not their remedy, and backtracking and sorting are unrelated techniques.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development