Topic summary · Decision maths (D1)
Algorithms summary
Decision-maths algorithms are precise recipes. Show each step in order — examiners mark the process as well as the final output.
Files: D1-Algorithms.pdf · D1-Algorithms answers.pdf · free public downloads · diagrams in the PDFs
Key learning points
- Follow the stated algorithm exactly (bin packing, sorting, etc.).
- Keep a clear trace table of intermediate states.
- Comment on comparisons/swaps when efficiency is asked.
- Validate on a small hand-worked example.
Worked example 1 — Trace
What should a sort-algorithm trace show?
Working
Intermediate states earn method marks.
Worked example 2 — Follow the stated algorithm exactly (bin packing, sorti
Use this method from the Algorithms sheet: Follow the stated algorithm exactly (bin packing, sorting, etc.).
Working
Each key learning point matches a question type on the printable worksheet.
Worked example 3 — Keep a clear trace table of intermediate states
Use this method from the Algorithms sheet: Keep a clear trace table of intermediate states.
Working
Each key learning point matches a question type on the printable worksheet.
Worked example 4 — Comment on comparisons/swaps when efficiency is asked
Use this method from the Algorithms sheet: Comment on comparisons/swaps when efficiency is asked.
Working
Each key learning point matches a question type on the printable worksheet.
Worked example 5 — Validate on a small hand-worked example
Use this method from the Algorithms sheet: Validate on a small hand-worked example.
Working
Each key learning point matches a question type on the printable worksheet.
Scaffolded Learning Sheet and answers (PDFs)
This page is a short, searchable overview for revision and search engines. Use the Scaffolded Learning Sheet first, then the Answers PDF for a full written solution. The printable PDFs remain the main classroom resource.