Answer Posted / Samir Kumar Singh

Here is a simple implementation of bubble sort in Python:n```ndef bubble_sort(arr):n n = len(arr)n for i in range(n-1):n for j in range(0, n-i-1):n if arr[j] > arr[j+1]:n arr[j], arr[j+1] = arr[j+1], arr[j]n arr = [34, 2, 65, 87, 9, 78, 44, 55, 13, 44] nbubble_sort(arr)n print(arr)```

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

1284

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

1209

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

1501

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.

1395

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

1040

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

1025