Automata & Formal Languages
Regular and context-free languages: the machines that recognise them and the limits of each.
Regular and context-free languages: the machines that recognise them and the limits of each.
How much work an algorithm does as its input grows, and how that estimate picks the implementation before you measure.
Shortest paths and minimum spanning trees: which algorithm fits which graph, and where the complexity moves.
Adjacency matrices, adjacency lists, topological sort and union-find: how a graph is stored decides which algorithm is cheap.
Arrays, linked lists, stacks, queues and hash tables: the storage trade-offs behind every collection API.
Quicksort, merge sort and binary search: the comparison model, stability, and when the input shape changes the right answer.
Binary trees, red-black trees, B-trees, B+ trees and heaps: the balance and fan-out choices behind ordered data.