Basic CS-Data Structures [TCS Placement]: Sample Questions 20 - 20 of 28

Get unlimited access to the best preparation resource for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

Question 20

Data Structures

Describe in Detail


What are the types of Collision Resolution technique and methods used in each of the type?


For open addressing (closed hashing) , the methods for collusion resistance are overflow block:

  • Closed hashing stores all records directly in the hash table.
  • Bucket hashing is a type of closed hashing.
  • Each record I has a home position .
  • If another record occupies i՚s home position, then another slot must be found to store i.
  • The new slot is found by a collision resolution policy.
  • Search must follow the same policy to find records not in their home slots.
The Closed Hashing
    • Closed addressing (open hashing) can use linked list, binary tree for collusion resolution
  • “Separate list” explains why open hashing is also known as “separate chaining”
  • For instance, the “open” in “open addressing” tells us the index at which an object will be stored in the hash table is not completely determined by its hash code.
  • Instead, the index may vary depending on what՚s already in the hash table.
  • Overflown elements hang off from the main table using list or tree.
Given the Image is Define the Example of Open Hashing (Separate Chaining)

Developed by: