Course Information
- Lecture: MWF 9:10 - 10:05 in Comm 111
- Instructor: Prof. Stucki
-
A continued exploration of the mathematical foundations of computer science begun in Discrete Mathematics.
Topics include asymptotic analysis and complexity, discrete probability, relations, graph theory, Boolean
algebra, and automata theory.
An essential aspect of the course is developing an ability to create and understand mathematically rigorous
arguments and/or proofs. This course will give students tools for utilizing precise vocabulary, powerful notation,
useful abstractions, and rigorous thinking.