Answer Posted / Satish Sharma

To find the middle element of a singly linked list in one pass, follow these steps:n1. Initialize two pointers: slow and fast.n2. Move the slow pointer one step ahead at each step, while moving the fast pointer two steps ahead.n3. After the loop ends, the slow pointer will be pointing to the middle element.

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

1016

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

1479

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

1190

“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

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