Answer Posted / Jagniwas

Advantages: 1) Efficient insertion and deletion operations, 2) Requires less memory for storing large amounts of data. Disadvantages: 1) Inefficient access to specific elements since you need to traverse the entire list, 2) Deleting a node can be complicated because you need to adjust pointers.

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

1026

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

1040

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.

1395

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

1284

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

1501

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

1210