21-228 Discrete Mathematics
9 units, Carnegie Mellon University
The techniques of discrete mathematics arise in every application of mathematics, which is not purely continuous, for example in computer science, economics, and general problems of optimization. This course introduces two of the fundamental areas of discrete mathematics: enumeration and graph theory. The introduction to enumeration includes permutations, combinations, and topics such as discrete probability, combinatorial distributions, recurrence relations, generating functions, Ramsey's Theorem, and the principle of inclusion and exclusion. The introduction to graph theory includes topics such as paths, walks, connectivity, Eulerian and Hamilton cycles, planar graphs, Euler's Theorem, graph coloring, matchings, networks, and trees. (Three 50 minute lectures, one 50 minute recitation)
Prerequisites: 21-128 or 15-151 or 21-127
Offered: Spring 2027, Fall 2026, Spring 2026, Fall 2025
Courseweave needs JavaScript to show sections, workloads and planning tools.