Answer Posted / Saurabh Agarwal

Here's an implementation of Merge Sort in Python:n```pythonndef merge_sort(arr):n if len(arr) <= 1:n return arrn mid = len(arr) // 2n left = merge_sort(arr[:mid])n right = merge_sort(arr[mid:])n return merge(left, right)ndef merge(left, right):n result = []n i, j = 0, 0n while i < len(left) and j < len(right):n if left[i] <= right[j]:n result.append(left[i])n i += 1n else:n result.append(right[j])n j += 1n result += left[i:]n result += right[j:]n return result

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

1049

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

1035

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

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

1295

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

1508

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

1225