divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in P and NP, and approximation algorithms.

incremental and recursive algorithms, divide-and-conquer, greedy algorithms. This course is delivered through a combination of lectures and classes totalling a minimum of 30 hours across Lent Term.