Classification of Algorithms (Big-O, Tractability, Halting)
AQA 75174.4.4A-levelLesson packSubscription
About this resource
Lesson pack for AQA A-level Computer Science (7517), 4.4 Theory of computation: slides, student worksheet, answers.
Unit bundlePaper 1
More from 4.4 Theory of computation
- Lesson pack · 4.4.1Abstraction and AutomationSubscription
- Lesson pack · 4.4.2Sets, Regular Expressions and Regular LanguagesSubscription
- Lesson pack · 4.4.2.1Finite State MachinesFree
- Lesson pack · 4.4.3.1Context-Free Languages: BNF and Syntax DiagramsSubscription
- Lesson pack · 4.4.5.1Turing MachinesSubscription
- Knowledge organiser · 4.4Theory of Computation (Part 1) — Abstraction, Automation & Finite State MachinesFree
- Knowledge organiser · 4.4Theory of Computation (Part 2) — Sets, Regular Expressions & BNFSubscription
- Knowledge organiser · 4.4Theory of Computation (Part 3) — Classification of Algorithms & Turing MachinesSubscription