Course Detail


Discrete Structures


An introduction to proof techniques with a focus on relevant computer science topics. Topics include: discrete probability, fundamental proof techniques, boolean logic, sequences and summations, set theory, algorithm analysis, recursion, mathematical induction, recurrence relations, an introduction to number theory, combinatorics, and graph theory.

Students may not receive credit for both Mathematics 230 and offerings of Mathematics 220 in Fall 2015 or later.

Not eligible for students with credit in MAT 230.

Replacement for MAT 220 (Combinatorics and Graph Theory)

Satisfies a major requirement in Mathematics

Satisfies a minor requirement in Mathematics

Satisfies a minor requirement in Computer Science

Satisfies a distribution requirement in Mathematical and Quantitative Thought


MAT 113

Prerequisite or co-requisite: the ability to program in a high-level language like Python, C++, or Java at the level expected in CSC 121 or an equivalent course. (Fall)