Answer Posted / Kumar Saurav

A 2-3 tree (or B-tree) is a self-balancing search tree that can efficiently store large amounts of data. It's called a 2-3 tree because each internal node has either two or three child nodes.

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

1049

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.

1406

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

1508

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

1294

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

1225

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

1035