← All courses

MATH 330: Discrete Mathematics

Mathematical structures underlying computer science and advanced mathematics: logic, sets, combinatorics, graph theory, recursion, and algorithm analysis. Prerequisite: MATH 201 or instructor consent.

Current Sections Fall 2026

330-01 In Person Time TBD · Syllabus & materials 330-02W Online Asynchronous · Syllabus & materials

Lecture Notes by Topic

GoodNotes links — opens in the GoodNotes app or web viewer.

1. Logic & Proof Techniques (Review)
2. Set Theory & Functions
3. Combinatorics & Counting Principles
4. Permutations & Combinations
5. Graph Theory Basics
6. Trees & Spanning Trees
7. Recursion & Recurrence Relations
8. Algorithm Analysis & Big-O Notation
9. Introduction to Boolean Algebra

Past Semesters Complete Record

Fall 2023 (330)