This is a list of exam questions organised by topic: bin packing, binary search, general algorithms, sorting algorithms, CPA, Dijkstra, forming linear programming, graphing linear programming, matchings, kruskals, Prims not Pimms, Planarity and route inspection.

This is a list of powerpoints, that may not be particularly exciting, but they teach the whole of D! in a quick and unfussy way What's not to like about that? The powerpoints are: algorithms, algorithms on graphs, CPA, linear programming and matchings.

This is the D1 glossary. You got to learn this word for word. Best get busy.

This is a D1 workbook. Do it.

I strongly advise checking out the hegarty maths section of work on D1 which can be found here.

This is a list of powerpoints, that may not be particularly exciting, but they teach the whole of D! in a quick and unfussy way What's not to like about that? The powerpoints are: algorithms, algorithms on graphs, CPA, linear programming and matchings.

This is the D1 glossary. You got to learn this word for word. Best get busy.

This is a D1 workbook. Do it.

I strongly advise checking out the hegarty maths section of work on D1 which can be found here.