This course provides academic credit for independent studies under the direction of a faculty member. The 
scope and direction of the studies are determined by the student (or small group of students) in consultation 
with the course instructor.

The fundamentals of graph theory: trees, connectivity, Euler tours, Hamilton cycles, matchings, colorings, and Ramsey theory.

This course is a problem-oriented introduction to the basic concepts of probability and statistics, providing a foundation for applications and further study.

Elementary combinatorial techniques used in discrete problem solving: counting methods, solving linear recurrences, graph and network models, related algorithms, and combinatorial designs.

Mathematical logic and proof, mathematical induction, counting methods, recurrence relations, algorithms and complexity, graph theory and graph algorithms. Credit not awarded for both MATH 2603 and MATH 2602.

Linear algebra eigenvalues, eigenvectors, applications to linear systems, least squares, diagnolization, quadratic forms.