Discrete Mathematics for Computer Science: Honors
A focus on discrete mathematical tools of fundamental importance to the working computer scientist. An emphasis is placed on using logical notation to express rigorous mathematical arguments. Subjects include proof by induction, graph theory, number theory, combinatorics, recurrences, sets, functions, an introduction to program correctness, and discrete probability. Computer Science 311 and 311H may not both be counted. Three lecture hours a week for one semester.
Prerequisites & course information
A focus on discrete mathematical tools of fundamental importance to the working computer scientist. An emphasis is placed on using logical notation to express rigorous mathematical arguments. Subjects include proof by induction, graph theory, number theory, combinatorics, recurrences, sets, functions, an introduction to program correctness, and discrete probability. Computer Science 311 and 311H may not both be counted. Three lecture hours a week for one semester.
Sources
- Course catalogue ↗2026-2027