Spring 2026 Course Search

Discrete mathematics studies problems that can be broken up into distinct pieces. Some examples of these sorts of systems are letters or numbers in a password, pixels on a computer screen, the connections between friends on Facebook, and driving directions (along established roads) between two cities. In this course we will develop the tools needed to solve relevant, real-world problems. Topics will include: combinatorics (clever ways of counting things), number theory and graph theory. Possible applications include probability, social networks, optimization, and cryptography.

In this course, students will gain experience with using simple programmable robots and how they can be utilized in STEM education. The focus of this class will be on learning and designing lessons for K-12 students utilizing these robots. This class is accessible for students at all levels of computer programming experience (including none).