Gamma-AN-01.05.2024

For the following question, how will the array elements look like after second pass if sorted using Insertion Sort? 34, 8, 64, 51, 32, 21

• 8, 21, 32, 34, 51, 64
• 8, 32, 34, 51, 64, 21
• 8, 34, 51, 64, 32, 21
• 8, 34, 64, 51, 32, 21

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

• Insertion sort
• Selection sort
• Quick sort
• Merge sort

The way a card game player arranges his cards as he picks them up one by one, is an example of

• bubble sort
• Selection sort
• insertion sort
• merge sort

As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

• bubble sort
• insertion sort
• selection sort
• Quick sort

int binarySearch(int arr[], int left, int right, int target) { if (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) return binarySearch(arr, mid + 1, right, target); else return binarySearch(arr, left, mid - 1, target); } return -1; } What type of binary search does this code snippet represent?

• Iterative binary search
• Recursive binary search
• Linear search
• Exponential search

int func(int arr[], int n, int target) { int left = 0; int right = n - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) left = mid + 1; else right = mid - 1; } return -1; } What is the primary purpose of the code snippet?

• Sorting an array in ascending order
• Searching for a target element in a sorted array
• Calculating the sum of elements in an array
• Reversing the order of elements in an array

int binarySearch(int arr[], int n, int target) { int left = 0; int right = n - 1; while (left < right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) left = mid; else right = mid; } return -1; } What issue or error is present in this code snippet?

• There is no issue; the code is correct
• The loop condition should be left <= right
• The left and right updates should be left = mid + 1 and right = mid - 1
• The return value is not correct

int binarySearch(int arr[], int n, int target) { int left = 0; int right = n - 1; while (left < right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) left = mid + 1; else right = mid; } return -1; } What is the primary issue with this code snippet?

• The code is correct; there are no issues
• The loop condition should be left <= right
• The left and right updates should be left = mid + 1 and right = mid - 1
• The target element is not correctly returned

int binarySearch(int arr[], int n, int target) { int left = 0; int right = n - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) left = mid + 1; else right = mid - 1; } return -1; } If you apply this binary search code snippet to a sorted array with 10 elements, how many iterations will it take to find the target element if it exists in the array?

• 1
• 2
• 3
• 4

int binarySearch(int arr[], int n, int target) { int left = 0; int right = n - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid + 1; else if (arr[mid] < target) left = mid + 1; else right = mid - 1; } return 0; } If you apply the above code snippet to a sorted array with 12 elements, and the target is not found, what will be the return value?

• 0
• 1
• -1
• 12