Answer Posted / Rabindra Kumar Singh

Collision Resolution techniques aim to handle hash table collisions efficiently. The main types are:
1. Separate Chaining: Each bucket contains a linked list, so when a collision occurs, the new element is inserted into the appropriate list.
2. Open Addressing: In this approach, elements are placed at different positions of the array to avoid collisions by probing for empty slots.nt- Linear Probing (sequential search for an empty slot)nt- Quadratic Probing (uses a quadratic function to find empty slots)nt- Double Hashing (uses two hash functions to compute indices and avoid clustering)

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.

1403

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

1047

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

1506

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

1292

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

1223

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

1033