Answer Posted / Deepika Rani
1) Collision: When multiple keys map to the same index, it causes a collision. Resolving collisions can lead to increased memory usage and decreased performance. 2) Load factor: The load factor affects the overall efficiency of separate chaining. A high load factor can cause frequent resizing, which is costly in terms of time and space. 3) Access Time: The average access time for data is relatively higher compared to other hash table implementations like open addressing.
| 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?
Can you declare an array without assigning the size of an array?
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)
