Answer Posted / Brajesh Kumar Meena
Double hashing is a load distribution strategy used in hash tables to find an empty slot when the initial hash value results in a collision. In double hashing, two hash functions (h1 and h2) are used, where h1 maps keys to indices and h2 ensures that collisions are spread evenly across the table. If the cell at index h1(key) modulo table size is occupied, the search continues to cells at indices [h1(key)+i*h2(key)] modulo table size (where i 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
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
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.
What sort of serious problems have you experienced, and how have you handled them?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
