Which of the following is not a collision resolving technique?a)Linear Probingb)Rehashingc)Seperate Chainingd)None of the mentioned

To tackle the question of which of the listed options is not a collision resolving technique, we first need to briefly review what collision resolution techniques are in the context of data structures, particularly hash tables.

Understanding Collision Resolution Techniques

1. Linear Probing: This technique involves checking the next available slot in the hash table if a collision occurs, effectively seeking a linear sequence of slots until an empty one is found.

2. Rehashing: This method entails computing a new hash value for the collided key, often using a different set of hash functions, to find an empty slot.

3. Separate Chaining: This approach involves maintaining a linked list (or any other structure) at each index in the hash table, where all elements that hash to the same index are stored.

4. None of the mentioned: This typically means all previous options are valid.

Analysis

• All three options above (Linear Probing, Rehashing, and Separate Chaining) are recognized techniques for resolving collisions when using hash tables.

Conclusion

• Since all the options provided (a, b, c) are valid collision resolution techniques, the correct choice for which option "is not a collision resolving technique" would be d) None of the mentioned.

Final Answer

d) None of the mentioned