Answer Posted / shivhar bhalerao

In B-tree more no of data pointer is required to store the
data and link of the data pointer ie. tree pointer so it
required more space accommodate in database.
But in B+ tree only leaf node is required to store data and
one link pointer so space is utilization is high as compare
to B tree ............

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.

1389

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

1023

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

1280

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

1209

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

1499

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

1038