Piyush used a hashing function that resulted in collision. Since backtracking will
take up a lot of time, he decided to use a collision resolution technique. Which of
the given techniques can he use for the same?
1. Open Addressing
2. Simulation
3. Chaining
Answers
Answered by
2
Answer:
Open Addressing is the answer of this question
Answered by
0
ANSWER:- Open Addressing .
EXPLANATION:- Hash tables use open addressing or closed hashing to resolve collisions. With this approach, a hash collision is resolved by probing, or looking in different places in the array (the probe sequence), until either the target record is found or an empty array slot is discovered, indicating that the table does not contain the key in question. [1] Several well-known probe sequences are:
Linear probing, where the space between probes is fixed and frequently set to 1.
The interval between probes is increased quadratically in quadratic probing (hence, the indices are described by a quadratic function).
When using double hashing, the time between probes is fixed for each record but is calculated using a different hash function.
The primary trade-offs among these techniques .
EXPLANATION:- Hash tables use open addressing or closed hashing to resolve collisions. With this approach, a hash collision is resolved by probing, or looking in different places in the array (the probe sequence), until either the target record is found or an empty array slot is discovered, indicating that the table does not contain the key in question. [1] Several well-known probe sequences are:
Linear probing, where the space between probes is fixed and frequently set to 1.
The interval between probes is increased quadratically in quadratic probing (hence, the indices are described by a quadratic function).
When using double hashing, the time between probes is fixed for each record but is calculated using a different hash function.
The primary trade-offs among these techniques .
Similar questions