Search Algorithm Quiz

What is a linear search algorithm used for?

• To sort items of data in ascending order

• To find items of data

• To delete items of data

• To update items of data

What happens when a linear search algorithm finds the desired item in the array?

• It continues to search through the rest of the array

• It deletes the item from the array

• It stops and displays the location of the item

• It restarts the search from the beginning of the array

What does a linear search algorithm do if the item is not found at the current index?

• It stops the search

• It moves to the previous item

• It moves to the next item

• It displays an error message

For binary searching to be possible, what condition must the set of data meet?

• The data must be in random order

• The data must be in descending order

• The data must be ordered

• The data must contain numeric values only

When performing a binary search and the search item is positioned lower than the middle, what part of the data set is searched next?

• The first quarter of the set

• The second half of the set

• The first half of the set

• The last quarter of the set

What is the position of the middle item if the lower bound is at index 0 and the upper bound is at index 10?

• 4

• 5

• 6

• 7

What operation is performed to find the 'midPoint' in the binary search algorithm?

• (first + last) * DIV 2

• (first + last) / 2

• (first + last) + DIV 2

• (first + last) DIV 2

Which search algorithm is considered simpler to code?

• Binary Search Algorithm

• Linear Search Algorithm

• Quick Search Algorithm

• Merge Search Algorithm

For which type of datasets is the binary search algorithm more efficient?

• Unordered datasets

• Small datasets

• Large datasets

• Datasets with duplicate values

Does the linear search algorithm require data to be ordered to work correctly?

• Yes

• No

• Only for numeric data

• Only for string data