I have been preparing for the maths subject test using Princeton Review as a rough guide on the level of depth required for each topic. But Princeton Review do not have anything regarding Algorithm, Geometry, Graph Theory or Numerical Analysis. I am not a pure maths major (majored in mathematical economics) and haven't taken Algorithm, Graph Theory or Numerical Analysis. So, I am a little bit lost with regards to the depth required in these topics.
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?