MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are specialized data structures designed for fast searching, such as hash tables, that can be searched more efficiently than binary search.

Detailed explanation-2: -Sorted Data: Linear search has no requirement for the data to be sorted. Binary search can only be implemented on sorted data. Efficiency: Binary search is faster (in terms of scan cycles) and more efficient compared to linear search especially for larger data sets.

Detailed explanation-3: -In simple words, if you have N elements and if e is in the first sqrt(N) elements, then exponential search will be faster, else binary search will be faster.

Detailed explanation-4: -Binary Search is more optimized and efficient than Linear Search in many ways, especially when the elements are in sorted order. The reason boils down to the complexities of both the searches. 1. Time Complexity: O(N)-Since in linear search, we traverse through the array to check if any element matches the key.