Answer Posted / Brijesh Kumar Nim

To find the middle element of a singly linked list in one pass, you can use two pointers. One pointer moves twice as fast as the other. Initially, both pointers start from the head node. After some time, the faster pointer will be at the end, and the slower pointer will be exactly at the middle. Here's a simple implementation in Python:

```python
def findMiddle(head):
slow = head
fast = head

while fast is not None and fast.next is not None:
slow = slow.next
fast = fast.next.next

return slow
```

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

1024

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

1016

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

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

1190

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

1479

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

1266