Computational Thinking and Further Programming — AS & A Level Computer Science 9618

Computational Thinking and Further Programming — AS & A Level Computer Science 9618: 2 chapters and 198 lesson cards — AI teacher explanations, worked examples, diagrams, common mistakes and exam-style questions, aligned to the Cambridge AS & A Level Computer Science 9618 syllabus.

Topics

1. 19 Computational Thinking and Problem-solving — Introduction · Key ideas — 19.1 (a) Linear and binary search · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (b) Insertion sort and bubble sort · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (c) Linked lists: finding an item · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (c) Linked lists: inserting and deleting · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (d) Binary tree operations · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (e) Stack and queue operations · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (f) Graphs, dictionaries, and ADTs built from other ADTs · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.1 (g) Comparing algorithms: Big O notation · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.2 (a) Recursion · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.2 (b) When recursion is beneficial · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 19.2 (c) How a compiler handles recursion: stacks and unwinding · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Worked example · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · Common mistakes · Practice · Summary
2. 20 Further Programming — Introduction · Key ideas — 20.1 (a) Low-level programming · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 20.1 (b) Imperative (procedural) programming · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 20.1 (c) Object-oriented programming: terms · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 20.1 (c) Object-oriented programming: classes in code · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 20.1 (d) Declarative programming · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 20.2 (a) File processing with records · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Key ideas — 20.2 (b) Exceptions and exception handling · 🧑‍🏫 Teacher's explanation · 📖 Definitions · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · 🧠 Quick check 1 · 🧠 Quick check 2 · 🎯 Exam question · Worked example · 🔍 Worked example — Easy · 🔍 Worked example — Standard · 🔍 Worked example — Exam-style · ⚠️ Common errors · Common mistakes · Practice · Summary