Search
Question: What is the worst-case time complexity of Heap Sort?Options: O(n log n)O(n^2)O(n)O(log n)C..
Question: Which sorting algorithm is based on the divide-and-conquer paradigm?Options: Bubble SortIn..
Question: What is the average time complexity of the Quick Sort algorithm?Options: O(n)O(n log n)O(n..
Question: What does the author suggest about the role of time management in CAT preparation?Options:..
Question: Which word in the passage is closest in meaning to \'arduous\'?Options: EasyDifficultSimpl..
Question: What is the relationship between the sections of the CAT exam as described in the passage?..
Question: Which of the following algorithms can be improved using binary search?Options: Insertion S..
Question: Which of the following is a common modification to binary search for finding the first occ..
Question: In binary search, what is the purpose of calculating the mid index?Options: To find the ma..
Question: If the binary search algorithm is implemented recursively, what is the space complexity du..
Question: What is the maximum number of iterations needed to find an element in an array of size 32 ..
Question: What happens if the array is not sorted before performing a binary search?Options: It will..
Question: What will be the result of a binary search for the value 10 in the array [1, 2, 3, 4, 5, 6..
Question: If a binary search is performed on an array of 32 elements, how many iterations will it ta..
Question: What is the worst-case number of comparisons in binary search for an array of size 16?Opti..
Question: Which of the following is a key requirement for implementing binary search?Options: The ar..
Question: In which of the following applications is binary search commonly used?Options: Finding the..
Question: What is the result of performing a binary search on the array [2, 4, 6, 8, 10] for the val..
Question: In a binary search, if the target value is not found, what will be the return value?Option..
Question: In binary search, what is the formula to find the middle index?Options: (low + high) / 2(l..
Question: What is the result of a binary search if the array is empty?Options: Returns 0Returns -1Re..
Question: In a binary search, if the middle element is greater than the target, which half of the ar..
Question: How does binary search determine the middle index of an array?Options: (low + high) / 2low..
Question: What is the result of binary search if the target is less than the middle element?Options:..
Question: Which of the following algorithms can be improved by using binary search?Options: Insertio..
Question: What must be true about the data structure for binary search to work?Options: The data mus..
Question: What is the primary advantage of using binary search over linear search?Options: Binary se..
Question: If the array is [1, 2, 3, 4, 5] and we search for 6, what will be the final result of bina..
Question: What is the mid index formula used in binary search?Options: (low + high) / 2(high - low) ..
Question: What is the effect of using binary search on a linked list?Options: Faster than arraySlowe..
