Linked and Binary Search

1. What is the worst-case time complexity of a linear search?

• O(log n)

• O(n)

• O(1)

• O(n log n)

In which of the following cases does linear search perform the best?

• When the element is at the middle

• When the array is sorted

• When the element is not present

• When the element is at the first position

Which of the following is not a characteristic of linear search?

• It can be applied on unsorted data

• It performs better on large datasets than binary search

• It is simple and easy to implement

• It checks elements sequentially

How many comparisons are made in the worst-case linear search in an array of size n?

• 1

• log n

• n

• n/2

Which type of data is most suitable for linear search?

• Sorted arrays only

• Only strings

• Linked lists or small unsorted datasets

• Binary trees
  

What is the primary condition for applying binary search?

• Array must contain integers only

• Array must be unsorted

• Array must be sorted

• Array must contain non-repeating elements

What is the average case time complexity of binary search?

• O(n)

• O(n log n)

• O(1)

• O(log n)

Binary search reduces the problem size by:

• One element at each step

• Half at each step

• One-third at each step

• Log base 2 of elements at each step

In recursive binary search, what is the base condition to stop the recursion?

• When the search value becomes negative

• When the index goes beyond array length

• When low > high

• When the value is not divisible by 2

Which of the following is true for binary search?

• It can be used for strings if they are sorted

• It doesn’t work for negative numbers

• It always finds the first occurrence in case of duplicates

• It requires O(n) space complexity