This is a second course in linear algebra that provides an in-depth study of fundamental concepts of the subject. It focuses largely on the effect that a choice of basis has on our understanding of and ability to solve problems with linear operators. Topics include linear transformations, similarity, inner products and orthogonality, QR factorization, singular value decomposition, and the Spectral Theorem. The course includes both computational techniques and the further development of mathematical reasoning skills.

This course covers the theory of graphs and networks for both directed and undirected graphs. Topics include graph isomorphism, Eulerian and Hamiltonian graphs, matching, covers, connectivity, coloring, and planarity. There is an emphasis on applications to real world problems and on graph algorithms such as those for spanning trees, shortest paths, and network flows.

This course introduces the mathematical theory of enumeration of discrete structures. Topics include enumeration, combinatorial proofs, recursion, inclusion-exclusion, and generating functions.