Answer Posted / Mithilesh Prasad

One approach is to maintain two pointers slow and fast initially at the head of the list. Move fast two steps ahead for each step that slow moves forward. Once fast reaches the end, slow will point to the second to last node. Move slow one more step forward to get the third-to-last node.

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

1479

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.

1372

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

1266

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

1024

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

1190

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

1016