Answer Posted / Vikram Kapoor

To reverse a singly linked list, you can use recursion or iterative methods. Here's a simple recursive implementation in Python:

```python
def reverseList(head):
def _reverse(prev, current):
if not current:
return prev
nextNode = current.next
current.next = prev
return _reverse(current, nextNode)

return _reverse(None, head)
```

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

1225

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

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

1508

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

1049

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

1294

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

1035