a.2 algorithm design & theory
Perfect the recipe. Explore the logic behind efficient code, from Boolean algebra and logic gates to Big O notation and the theoretical limits of what computers can solve.
An algorithm is just a fancy word for a recipe, but in Computer Science, that recipe needs to be perfect. Algorithm Design & Theory is where we craft the precise, step-by-step instructions that tell a computer exactly what to do. But it’s not enough for code to just "work" - it needs to be fast and efficient. We look at Standard Algorithms for sorting and searching that every coder should know, use Big O Notation to measure how much memory and time our code steals, and dive into the deep theory of what computers can (and can't) actually solve.
Peek inside the brain of the machine! Discover how simple logic gates and True/False questions combine to build the complex circuits that power every computer on Earth.
Code that works is good, but code that flies is better. Learn to measure efficiency with Big O notation and design algorithms that save time, memory, and battery life.
Don't reinvent the wheel! Master the 'greatest hits' of coding - proven algorithms for sorting data, searching files, finding the shortest path, and keeping secrets safe.
Predict the future without a crystal ball. Learn how computational modelling lets you simulate real-world events - from crashing cars to spreading viruses - safely inside a computer.
What are the limits of a machine? Dive into the deep philosophy of computing, from Turing Machines and AI to the mind-bending world of quantum physics.
Last modified: February 13th, 2026
