Question : Which searching algorithm checks each element one by one until the target is found?
Solution :
Correct Answer : Linear Search
Description -
Question : Binary Search works only when the array is:
Solution :
Correct Answer : Sorted
Description -
Question : Worst-case time complexity of Linear Search is:
Solution :
Correct Answer : O(n)
Description -
Question : Worst-case time complexity of Binary Search is:
Solution :
Correct Answer : O(log n)
Description -
Question : Which searching algorithm is simpler to implement?
Solution :
Correct Answer : Linear Search
Description -
Question : Binary Search repeatedly divides the search interval into:
Solution :
Correct Answer : Two equal parts
Description -
Question : Which search algorithm can be used on an unsorted array?
Solution :
Correct Answer : Linear Search
Description -
Question : Average time complexity of Linear Search is:
Solution :
Correct Answer : O(n)
Description -
Question : Binary Search is based on which strategy?
Solution :
Correct Answer : Divide and Conquer
Description -
Question : Which search algorithm performs better for large sorted datasets?
Solution :
Correct Answer : Binary Search
Description -
Question : In Binary Search, the middle index is calculated as:
Solution :
Correct Answer : (low + high) / 2
Description -
Question : Best-case time complexity of Linear Search is:
Solution :
Correct Answer : O(1)
Description -
Question : Best-case time complexity of Binary Search is:
Solution :
Correct Answer : O(1)
Description -
Question : Binary Search cannot be efficiently applied to:
Solution :
Correct Answer : Unsorted Array
Description -
Question : Maximum number of comparisons required in Binary Search for 16 elements is:
Solution :
Correct Answer : 5
Description -
Question : What is the worst-case number of comparisons in Linear Search for an array of size n?
Solution :
Correct Answer : n
Description -
Question : Which data structure benefits the least from Binary Search?
Solution :
Correct Answer : Linked List
Description -
Question : Binary Search reduces the search space by:
Solution :
Correct Answer : 50%
Description -
Question : If Binary Search is applied to an unsorted array, the result is:
Solution :
Correct Answer : Unpredictable
Description -
Question : Which statement is TRUE?
Solution :
Correct Answer : Binary Search works only on sorted data.
Description -