COMPUTER SCIENCE TRIPOS Part IA – 2015 – Paper 1 Algorithms (TMS) (a) Consider the two standard representations of directed graphs: the adjacency-list representation and the […]
COMPUTER SCIENCE TRIPOS Part IA – 2015 – Paper 1 Algorithms (FMS) (a) Explain the greedy strategy in algorithm design. To what problems does it apply? […]
COMPUTER SCIENCE TRIPOS Part IA – 2015 – Paper 1 Algorithms (FMS) Reminders: A red-black tree has leaf nodes (black) and may have non-leaf nodes (red […]