# Searching algorithms

## Quiz by Rosina Crisa

### Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

10 questions
• Q1
A linear search
checks each element of the list for the target value, one at a time, from the end of the list.
checks each element of the list for the target value, one at a time, from the middle of the list.
checks each element of the list for the target value, two at a time, from the beginning of the list.
checks each element of the list for the target value, one at a time, from the beginning of the list.
30s
• Q2
A linear search only works on an ordered list.
False
True
30s
• Q3
A binary search works on an ordered list.
True
False
30s
• Q4
How many checks does it take to find 65 in the following list using a linear search? 2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101
3
11
10
9
30s
• Q5
How many checks would it take to find 65 in the following list using a binary search? 2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101
2
5
3
4
30s
• Q6
How many checks would it take to find 99 in the following list using a binary search? 2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101
7
8
6
5
30s
• Q7
How many checks would it take to find 24 in the following list using a binary search? 2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101
5
3
2
4
30s
• Q8
How many checks would it take to find 101 in the following list using a linear search? 2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101
5
10
9
11
30s
• Q9
A binary search
checks the midpoint element in an ordered list to see if it is equal to or higher than the search item. If the search item is not equal to the midpoint element but is higher that the midpoint element then the midpoint element and all those lower are discarded and the check is repeated on the remaining items until the item is found.
checks each element of the list for the target value one at a time from the middle of the list.
checks the midpoint element in an unordered list to see if it is equal to or higher than the search item. If the search item is not equal to the midpoint element but is higher that the midpoint element then the midpoint element and all those lower are discarded and the check is repeated on the remaining items until the item is found.
checks each element of the list for the target value one at a time from the beginning of the list.
30s
• Q10
A binary search will work on any list.
False
True
30s

Teachers give this quiz to your class