Define quadratic probing?
- 1 Answers
- 1123 Views
- I also Faced
- E-Mail Answers
Answer / Anurag Singh Chauhan
Quadratic probing is a load distribution strategy used in hash tables to find an empty slot when the initial hash value results in a collision. In quadratic probing, if the cell at index h (hash value modulo table size) is occupied, the search continues to cells at indices h+k^2 (where k starts from 1 and increments by one for each collision), wrapping around the table at both ends.
| Is This Answer Correct ? | 0 Yes | 0 No |
Why arraylist is not efficient for manipulation?
Can a binary tree be empty?
Why enum can not be used directly with printf function?
What is a simple path?
Differentiate between compilers and interpreters.
Is array size dynamic or fixed?
Why you need a data structure?
What is doubly linked list?
How many parts are there in a declaration statement using data structures?
Is linkedlist thread safe?
What is the method to find the complexity of an algorithm?
why do tree always takes o(log n) time?
Windows 
