Searching Algorithms GCSE

How many linear searches will it take to find the value 7 in the list [1,4,8,7,10,28]?

• 2
• 3
• 4
• 5

A Linear search algorithm requires data to be ordered.

• True
• False

What is an advantage of the Linear search algorithm?

• Performs well with small sized data sets
• Can be used on data sets with more than a million elements
• Is complicated to code

What is a disadvantage of the Linear search algorithm?

• It will only work on a sorted data set
• May be too slow to process large data sets

Select the best description to explain what a linear search algorithm is.

• Put the elements in order, check each item in turn.
• Put the elements in order, compare with the middle value, split the list in order and repeat.
• Elements do not need to be in order, check each item in turn.
• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

What is an Algorithm?

• A chart showing the flow of a series of events
• Step-by-step instructions used to solve a problem
• A decision arrived at by following instructions
• A computer program that follows a chart

Which type of lists or data sets are binary searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

Select the best description to explain what a binary search algorithm is.

• Put the elements in order, check each item in turn.

• Put the elements in order, compare with the middle value, split the list in order and repeat.

• Elements do not need to be in order, check each item in turn.

• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

A binary search is to be performed on the list:
3  5  9  10  23
How many comparisons would it take to find number 9?

• 0-1
• 2-3
• 4-5
• I can't find the number 9

A binary search is to be performed on the list:
1  5  10  13  48  68  100  101
How many comparisons would it take to find number 101?

• 0-1
• 1-2
• 3-4
• 4-5