Answer Posted / saurabh teotia

the complexity of linear search is o(n) n that of binary search is o(logn)

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

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

1035

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

1049

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

1225

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

1295

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

1508