Unit at a glance
5 lessons, 225 minutes of teaching
Scheme of work
The lessons in order
| Ref | Lesson pack | Structure | Worksheet | Quiz | Lab tab |
|---|---|---|---|---|---|
| 19.1 | Binary search A binary search finds an item in a sorted list by checking the middle item and throwing away the half that cannot hold it. | Round Table | 6 Q, 23 marks | 6 MCQ | tab 3 |
| 19.1 | Insertion sort and comparing sorts An insertion sort builds a sorted part at the front of the list, taking the next item each time and sliding it back to where it belongs. | Think-Pair-Share | 6 Q, 23 marks | 6 MCQ | tab 4, tab 5 |
| 19.1 | Stacks, queues, linked lists and binary trees At A Level you must write the algorithms that make each abstract data type work: insert into and delete from a stack, a queue and a linked list, and insert into and find in a binary tree. | Mix-Pair-Share | 6 Q, 26 marks | 6 MCQ | tab 2, tab 3, tab 4 |
| 19.1 | Comparing algorithms: Big O notation Two algorithms that do the same job can be compared by the time they take and the memory they use. | Jigsaw | 6 Q, 20 marks | 6 MCQ | tab 5 |
| 19.2 | Recursion and the call stack A recursive subroutine solves a problem by calling itself on a smaller version of the same problem until it reaches a case it can answer directly. | Corners | 6 Q, 23 marks | 6 MCQ | tab 4 |
Each pack holds the plan, worksheet and quiz for its lesson. Teach the rows in order; the lab tabs match the student lessons.
Also for this topic