DSA - Searching

What is the goal of a search algorithm?

• Sort the input list
• Insert an element
• Find the position of a target element
• Delete a node

Which of the following is NOT a reason why searching can be difficult?

• Big data size
• Time constraints
• Feature is easy to describe
• Storage method

Which of the following is a search application?

• Google Search
• RAM
• Hard disk
• CPU

What is the basic operation of a search algorithm?

• Multiplication
• Assignment
• Comparison
• Division

What are the inputs to a search algorithm?

• A list and a key
• A tree and an index
• Two sorted arrays
• None of the above

Which search algorithm checks elements one by one?

• Binary search
• Breadth-first search
• Sequential search
• Depth-first search

Which type of data structure is best for binary search?

• Unsorted array
• Sorted array
• Linked list
• Graph

Binary search is based on which strategy?

• Dynamic programming
• Divide and conquer
• Greedy
• Brute force

In binary search, if the middle element is greater than the key?

• Search right sub-array
• Stop search
• Search left sub-array
• Return -1

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

• O(log n)
• O(n)
• O(n log n)
• O(1)