Lesson T1.2.2
T1.2.2 Searching algorithms Quiz: KS3 Computing, Unit 1
20 questions
In partnership with Revision Ninja
Lesson T1.2.2, Searching algorithms: 20 multiple choice questions for the KS3 Computing (National Curriculum), Unit 1: Computational thinking and algorithms, written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What is the primary function of a search algorithm?
- Encrypting secure files
- Compressing storage
- Ordering numeric data
- Locating target items
-
How does a linear search examine items in a list?
- Randomly jumping
- Backwards only
- Halving each time
- One by one
-
What condition must be met for a binary search to work?
- Must contain numbers
- Must be shuffled
- Must be reversed
- Must be sorted
-
Binary search looks for a value in the sorted list [1, 3, 5, 7, 9, 11, 13, 15, 17]. Which item is checked first?
- 1
- 9
- 11
- 7
-
Binary search checks middle item 9 for target 13 in a list. Which part is searched next?
- Greater than 9
- Less than 9
- Equal to 9
- The entire list
-
A list has 10 items. What is the most checks linear search needs?
- 9
- 10
- 5
- 1
-
A list has 16 sorted items. Binary search halves the remaining items at each step. About how many checks are needed at most?
- 16
- 8
- 2
- 4
-
Which search method is quicker on a large sorted list?
- Binary search
- Random search
- Linear search
- Bubble search
-
Which search is most suitable for finding a word in an alphabetised dictionary?
- Binary search
- Linear search
- Serial search
- Random search
-
Why is linear search still useful for unordered data?
- It is always fastest
- Needs no sorting
- It uses less RAM
- It sorts the list
-
The list is [8, 3, 6, 1]. Linear search looks for 6. How many items are checked?
- 3
- 4
- 1
- 2
-
Linear search looks for 10 in [4, 7, 2, 9]. What is the result?
- Found at position 2
- Found at position 1
- Not found
- Found at position 4
-
Binary search looks for 5 in the sorted list [2, 4, 6, 8]. What is the result?
- Not found
- Found at position 3
- Found at position 2
- Found at position 4
-
What is the main drawback of using binary search?
- Slow on small lists
- Only works in Python
- Requires sorted data
- Too many variables
-
For an unsorted list of names searched many times, what is the best first step?
- Reverse the order
- Use linear search
- Delete half items
- Sort the list
-
A sorted list has 1000 items. About how many checks does binary search need at worst?
- 500
- 10
- 100
- 1000
-
What does the index of an item in a list represent?
- Item value
- Data type
- Position number
- Memory address
-
A search checks the middle item and finds it is smaller than the target. Where should it look next?
- End of list
- Start of list
- Lower half
- Upper half
-
Which scenario makes linear search the most sensible choice?
- Repeated searching
- Large sorted database
- Millions of records
- Short unsorted list
-
Linear search looks for 7 in the list [7, 2, 5]. How many items does it check?
- 3
- 1
- 2
- 0
Related quizzes
- Computational abstractions of real-world systems Quiz · T1.1.1 · 20 questions
- Sorting algorithms Quiz · T1.2.1 · 20 questions
- Comparing the utility of algorithms Quiz · T1.2.3 · 20 questions
- Solving problems with two or more programming languages Quiz · T2.1.1 · 20 questions
- AND, OR and NOT Quiz · T3.1.1 · 20 questions
- Hardware and software components Quiz · T4.1.1 · 20 questions
- Combining applications across devices Quiz · T5.1.1 · 20 questions
- Using technology safely, respectfully and responsibly Quiz · T6.1.1 · 20 questions
- Textual programming languages Quiz · T2.1.2 · 20 questions
- Boolean logic in circuits and programming Quiz · T3.1.2 · 20 questions