- Counting Operations to Compare Algorithmsages 16 to 17 · 8 questions
- Stacks: Last In, First Outages 16 to 18 · 8 questions
- Queues: First In, First Outages 16 to 18 · 8 questions
- Recursion and the Call Stackages 17 to 18 · 18 questions
- Big-O Notation and Orders of Growthages 16 to 17 · 8 questions
- Linked Lists and Nodes That Pointages 16 to 18 · 8 questions
- Hash Tables and Near-Constant Lookupages 16 to 18 · 8 questions
- Quadratic Sorts: Bubble and Insertionages 16 to 17 · 8 questions
- Merge Sort and Divide and Conquerages 17 to 18 · 8 questions
- Trees and Binary Search Treesages 17 to 18 · 12 questions
- Graphs and How to Store Themages 17 to 18 · 17 questions
- Breadth-First and Depth-First Searchages 17 to 18 · 8 questions
- Dijkstra's Shortest Pathages 17 to 18 · 8 questions
- Finite State Machines and What They Recogniseages 17 to 18 · 8 questions
- Turing Machines and the Universal Machineages 17 to 18 · 8 questions
- The Halting Problem: A Task No Program Can Doages 17 to 18 · 8 questions
- Loop Invariants and Proving an Algorithm Correctages 18 to 19 · 10 questions
- Asymptotic Notation Made Preciseages 18 to 19 · 8 questions
- Recurrence Relations and the Master Theoremages 18 to 20 · 16 questions
- Divide and Conquer as a Design Methodages 18 to 20 · 8 questions
- Randomised Quicksort and Expected Running Timeages 19 to 20 · 8 questions
- The Comparison-Sorting Lower Boundages 19 to 20 · 8 questions
- Heaps and Priority Queuesages 19 to 20 · 8 questions
- Amortised Analysisages 19 to 21 · 8 questions
- Greedy Choice and the Exchange Argumentages 19 to 21 · 8 questions
- Dynamic Programming: Optimal Substructure and Overlapping Subproblemsages 20 to 21 · 8 questions
- Dynamic Programming on Two Sequencesages 20 to 21 · 8 questions
- Dynamic Programming with a Capacity: Knapsackages 20 to 22 · 8 questions
- Shortest Paths with Negative Weights and Between All Pairsages 20 to 22 · 8 questions
- Union-Find and Minimum Spanning Treesages 20 to 21 · 14 questions
- Network Flow and the Max-Flow Min-Cut Theoremages 21 to 22 · 8 questions
- Reductions: Solving One Problem by Turning It into Anotherages 21 to 22 · 8 questions
- P, NP and What NP-Complete Meansages 21 to 22 · 8 questions
- Living with NP-Hardness: Approximation and Heuristicsages 21 to 22 · 8 questions
- Complexity Beyond NP: Space, Randomness and the Hierarchyages 22 to 24 · 8 questions
- Randomised Algorithms and the Probabilistic Methodages 22 to 23 · 8 questions
- SAT Solvers and What Makes Search Practicalages 22 to 24 · 8 questions
- Concentration Bounds and a High-Probability Guaranteeages 22 to 23 · 8 questions
- Approximation Ratios and How One Is Provedages 22 to 23 · 8 questions
- Linear Programming, Duality and Roundingages 22 to 23 · 8 questions