Searching: linear, binary and binary tree search
This worksheet marks itself
Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.
- 11 questions
- 31 marks
- about 35 minutes
- marked instantly
Question types: short answer, multiple choice, true or false, matching.
Try one from this worksheet
A binary search uses Mid ← (Low + High) DIV 2. Low is 4 and High is 9. Identify the value of Mid.
Pick an answer: it's marked straight away, just as your pupils would see it.
About this resource
AQA A-level Computer Science (7517) 4.3.4.1 Linear search · 4.3.4.2 Binary search · 4.3.4.3 Binary tree search. C# lesson 3 of 5 in 4.3 Fundamentals of algorithms: a trace-the-search Do Now, a short key idea, an 11-challenge ladder in three sets with exact test data, two exam questions and a work…
17 slides.
Lesson outline
- Do Now: trace the search
- Do Now: answers
- Key idea: Linear search: one item at a time
- Key idea: Binary search: halve what is left
- Key idea: Binary search: the algorithm, and not found
- Key idea: Binary tree search, and how they grow
- Set 1: linear search
- Set 2: binary search
- Exam question E1: trace a binary search
- Model answer E1
- Exam question E2: how the searches grow
- Model answer E2
