For Algorithm and Graph Theory, I am going to use "Discrete Mathematics" by Norman L. Biggs, 2nd edition covering these topics :

**Algorithm**: Introduction/basic, Efficiency, Growth rates (big O notation), Comparison, Sorting Algorithm.

**Graph Theory**: Introduction/basic, Isomorphism of Graphs, Degree of a vertex, Path and Cycles, Trees, Vertex Coloring, Trees and sorting algorithms, Spanning Trees and MST problem, Search (depth-first, breadth-first).

Might be covering too much for Graph Theory if we consider how little questions on graph theory will come out in the test. Also, does anyone have any advice for Geometry and Numerical Analysis? These are listed in the syllabus but I have no idea what is the depth required. Any books to recommend?