Which of the following algorithms guarantees finding the target element in a sorted array if it exists?
Binary Search
Linear Search
Interpolation Search
Both Linear Search and Binary Search
Rotating an array by 'k' positions to the right means:
Reversing the entire array.
Shifting each element 'k' positions to the right.
Shifting each element 'k' positions to the left.
Sorting the array in descending order.
Merge Sort is considered a stable sorting algorithm. What does 'stable' mean in this context?
The algorithm maintains the relative order of elements with equal values after sorting.
The algorithm uses a fixed amount of memory regardless of the input size.
The algorithm is not affected by the initial order of elements in the array.
The algorithm always takes the same amount of time to sort an array of a given size.
Which sorting algorithm would be most suitable for sorting a very large dataset that cannot fit entirely in RAM?
Quick Sort
Merge Sort
Heap Sort
You want to search for a target value in a sorted array with millions of elements. Which algorithm would generally be the fastest?
Jump Search
What is the time complexity of searching for a target value in a sorted array using binary search?
O(n log n)
O(1)
O(n)
O(log n)
In merge sort, what is the maximum number of comparisons required to merge two sorted subarrays of size 'm' and 'n' into a single sorted array of size 'm+n'?
m * n
m + n
m * n - 1
m + n - 1
Which of the following is NOT a characteristic of a stable sorting algorithm?
Can be implemented in both recursive and iterative forms.
Preserves the order of equal elements.
Suitable for sorting objects based on multiple criteria.
Always has a time complexity of O(n log n).
In which scenario would using Insertion Sort for sorting an array be advantageous?
Sorting an array with many duplicate elements.
Sorting an almost sorted array.
Sorting an array in reverse order.
Sorting a very large array.
You need to rotate an array by a very large 'k'. What optimization can be applied to improve efficiency?
Sort the array before rotation.
Calculate the effective rotation (k % n) where n is the array length.
Use a temporary array to store elements.
No optimization is possible for large 'k'.