Searching

Question 1

What is the primary requirement for searching a list of items?

Answer 1

A target search key

The search algorithm needs a specific key to look for within the list.

Question 2

What are the two main types of search algorithms?

Answer 2

• Linear search
• Binary search

Question 3

What does linear search involve?

Answer 3

Comparing each item with the target key until a match is found or the end of the list is reached.

Question 4

In a linear search, what equality operator is used for primitive types?

Answer 4

==

Question 5

What method is used to compare objects for equality in Java?

Answer 5

key.equals(array[i])

Question 6

What is a requirement for using binary search?

Answer 6

The list must be ordered.

Question 7

How does binary search operate?

Answer 7

By comparing the target key with the middle item and reducing the search space in half.

Question 8

Which searching algorithm requires a sorted list?

Answer 8

Binary Search

Question 9

Which searching algorithm is generally more efficient?

Answer 9

Binary Search

Question 10

Fill in the blank: The _______ search algorithm can search an unordered list.

Answer 10

Linear

Question 11

Which is the simpler searching algorithm to implement?

Answer 11

Linear Search