DSA + System Design 8

In which of the following scenarios is a linear search preferable?

• When the list is sorted.

• When the list is unsorted or small.

• When there is a need for constant time complexity.

• When searching in a balanced binary tree.

Which of the following statements is true about linear search?

• Linear search can only be used with arrays

• Linear search is more space efficient than binary search

• Linear search can be used on both sorted and unsorted lists

• Linear search requires the list to be unsorted

If you have a list of 100 elements, how many minimum comparisons will linear search make to find largest element?

• 1

• 10

• 50

• 100

Linear search can be applied to which of the following data types?

• Arrays

• Linked lists

• Strings

• All of the above

What is the time complexity of binary search in the worst-case scenario?

• O(n)

• O(log n)

• O(n log n)

• O(1)

In which type of list can binary search be applied?

• Unsorted list

• Sorted list

• Linked list

• All of the above

If you have a list of 1024 elements, how many comparisons will binary search make in the worst-case scenario?

• 10

• 100

• 512

• 1024

In a binary search, if the element to be found is at the first position, how many comparisons are made in the best-case scenario?

• 0

• 1

• logn

• n

In a binary search, the worst-case scenario occurs when

• The element is at the beginning of the list

• The element is at the end of the list

• The element is not in the list

• All of the above

What is the time complexity of ternary search in the worst-case scenario?

• O(1)

• O(n)

• O(log₂ n)

• O(log₃ n)