AI1: Simulated Annealing, Constraint Handling

DSA: Summer 2022 Paper Review

B+ Trees (DSA)

DSA: Resit 2022 Paper Review

Binary Search Trees and AVL Trees (DSA)

Other Complexity Measures (DSA)

Binomial Heaps (DSA)

Amortized Time Complexity (DSA)

Binary Heap Trees (DSA)

Dijkstra, Jarnik Prim, Union-Find, Kruskal (DSA)

TOC: Revision Session Recording 13/05/2024

Big-O Complexity Proofs (TOC)

Context-free grammars, ambiguity and Chomsky normal form

Undecidability, the Halting Problem and Problem Reduction (TOC)

Regular expressions (TOC)

Prove a language is non-regular by contradiction (TOC)

Checking for DFA / language equivalence (TOC)

Minimizing a DFA (TOC)

Church's Thesis (TOC)

Definition of NP (TOC)

Converting a regular expression to a total DFA (TOC)

AI1: Mock 2023 Paper Review

AI1: Summer 2023 Paper Review

AI1: Resit 2022 Paper Review

AI1: Simulated Annealing, Constraint Handling