Answer Posted / Pushpendra Katiyar

Binary search is more efficient than linear search, especially for large data sets. The main advantage of binary search is that it operates by repeatedly dividing the search interval in half, reducing the number of comparisons required to find an element. This results in a time complexity of O(log n) in the average case, while linear search has a time complexity of O(n).

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

1284

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

1025

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

1210

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

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

1501

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

1040