CS 125 - Discrete Structures For Computing
- Recent Professors
- Tim Schumacher
- Recent Semesters
- Fall 2026
- Class Size
- Not published
- Difficulty
- 4.4Moderateout of 10
- Credits
- 4
- Prerequisite
- CS/IS135 or equivalent
- Fall 2026 Sections
- View Fall 2026 sections of CS 125
- Transfers To
- Not transferable
- Description
- CS/IS 125 is a course in discrete structures that furnishes a strong foundation of mathematical tools for modeling problems and applications in computer science. Topics include logic operations, combinatorics, undirected and directed graphs, trees, relations and sets, proofs, Boolean algebra, algebraic systems, finite state automata, and discrete probability.