Summary
An introduction to mathematical topics relevant to computer science. Combinatorics, probability and graph theory will be covered in the context of computer science applications. The course will present a computer science approach to thinking and modeling. Students will be introduced to fundamental concepts in theoretical computer science, such as NP-completeness and cryptography that arise from the world view of efficient computation.
Course Content
We will cover basic topics in math that are important in computer science as well as basic topics in theoretical computer science. The following is a rough estimation of the number of lectures spent on each topic:
- Mathematical Proofs (1.5 lectures)
- Combinatorics (2 lectures)
- Probability Theory (6 lectures)
- Quizzes (replacing almost 1 lecture in terms of duration)
- Graph Theory (4 lectures)
- Game Theory (1.5 lectures)
- Countable vs Uncountable Sets (1 lecture)
- Theoretical Computer Science (Computability, Complexity, Cryptography) (7 lectures)
Faculty Teaching Staff
Graduate TAs
Precepts
Undergraduate Lab TAs
Undergraduate Graders
Undergraduate Program Manager
Please direct questions concerning enrollment or your precept assignment to Colleen Kenny-McGinley, the CS Department's Undergraduate Program Manager. Colleen's contact information is provided later on this page. The course's Faculty and Graduate TAs do not manage enrollment or precept assignments.