Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / Kapil Deol
Hashing is a technique used to map keys or values to indices in an array, providing quick data access with constant time complexity (O(1)). The hash function takes an input key and produces a unique index in the hash table. Collisions may occur when multiple inputs produce the same index, which can be managed using various collision resolution methods like chaining and open addressing.
| 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)
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
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.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
