Catalog of Courses

MA201 - Foundations of Discrete Mathematics

An introduction to combinatorics, graph theory, and combinatorial geometry. The topics are fundamental for the study of many areas of mathematics as well as for the study of computer science, with applications to cryptography, linear programming, coding theory, and the theory of computing. Meets the Critical Perspectives: Quantitative Reasoning requirement. Meets the Critical Learning: FRL requirement.

Prerequisite: Any two of : Mathematics 117, Mathematics 217, Mathematics 120, Mathematics 125, Mathematics 126, Mathematics 129 or equivalent.

Degree requirement — Critical Learning: FRL, Critical Perspectives: Q

1 unit — Malmskog

Previously Featured Offering

Aug. 2015
Foundations of Discrete Mathematics explores introductory level combinatorics, graph theory, and combinatorial geometry. Students will discover the connection between discrete mathematics and computer science.
Foundations of Discrete Mathematics
Foundations of Discrete Mathematics is an introduction to combinatorics, graph theory, and combinatorial geometry. The topics are fundamental for the study of many areas of mathematics as well as for the study of computer science, with applications to cryptography, linear programming, coding theory, and the theory of computing.

Offerings

Term Block Title Instructor Location Student Limit/Available Updated
Fall 2024 Block 1 Foundations of Discrete Mathematics Beth Malmskog Barnes Science Center 114 25 / 21 12/22/2024
Spring 2025 Block 7 Foundations of Discrete Mathematics TBA 25 / 7 12/22/2024
Report an issue - Last updated: 12/22/2024