Answer Posted / 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 |
Post New Answer View All Answers
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
Write a program for Sorting an Array. Which sorting will you prefer?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
