# Searching algorithms

## Quiz by Rosina Crisa

Feel free to use or edit a copy

includes Teacher and Student dashboards

### Measure skillsfrom any curriculum

Measure skills

from any curriculum

Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.

With a free account, teachers can

- edit the questions
- save a copy for later
- start a class game
- automatically assign follow-up activities based on students’ scores
- assign as homework
- share a link with colleagues
- print as a bubble sheet

10 questions

Show answers

- Q1A linear searchchecks 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
- Q2A linear search only works on an ordered list.FalseTrue30s
- Q3A binary search works on an ordered list.TrueFalse30s
- Q4How 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, 10131110930s
- Q5How 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, 101253430s
- Q6How 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, 101786530s
- Q7How 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, 101532430s
- Q8How 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, 10151091130s
- Q9A binary searchchecks 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
- Q10A binary search will work on any list.FalseTrue30s