Answer Posted / Sandeep Kumar Chauhan

1. Chaining: Each hash value corresponds to a linked list, and if a collision occurs, the new element is added to the corresponding linked list.n2. Open Addressing: If a collision occurs, we probe the consecutive positions until an empty slot is found.n a. Linear Probing:n - Increment the index by 1 for each probe.n b. Quadratic Probing:n - Increment the index by i^2, where i = 0, 1, 2, ...n c. Double Hashing:n - Use a second hash function to find empty slots when collisions occur.

Can you declare an array without assigning the size of an array?

1194

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1271

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1487

Write a program for Sorting an Array. Which sorting will you prefer?

1033

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.

1379

What sort of serious problems have you experienced, and how have you handled them?

1018