This course is an introduction to ideas and techniques from discrete mathematics that are used in computer science. It emphasizes mathematical proof and problem solving, employed on a variety of useful and interesting examples in counting, discrete probability, graphs, and basic number theory.
On completion of the course, students will be practiced in using mathematical concepts and techniques to solve problems, and in expressing mathematical notions precisely. They will be able to use ideas and techniques from discrete mathematics in subsequent courses in computer science, in particular courses in the design and analysis of algorithms, networks, numerical methods, software engineering, data analysis, and machine learning.
Topics covered include: methods of proof, including mathematical induction; number theory, including divisibility, prime numbers, modular arithmetic, with applications to cryptography; counting, including permutations, combinations, binomial theorem, pigeonhole principle, inclusion-exclusion principle; discrete probability, including conditional probability, independence, Bayes's rule, random variables, expected value, variance, Markov and Chebyshev bounds; graphs, including graph isomorphism, Euler and Hamiltonian paths, trees, graph coloring, and planar graphs; recursion.
Students are responsible for all material presented in lectures and on homework assignments.
• Lectures: Course material from the current week will be presented in lecture format at the class meetings.
• Homework: Weekly homework assignments are assigned after class and due the night before the next class. Homework must be submitted electronically. Students are required to submit weekly homework to pass the course.
• Exams: There will be a midterm exam and a final exam. There will be no make-up exams.
The course grade is based on weekly homework assignments and exams.
• Homework: 10%.
• Midterm examination: 30%.
• Final examination: 60%.
Discrete Mathematics and its Applications (7th edition) (McGraw-Hill) by Kenneth H. Rosen (ISBN 978-0073383095). Course notes of MIT's Mathematics for Computer Science
Precalculus, especially logarithms and exponentials, is a prerequisite; calculus is recommended. High-school level familiarity with sets, functions, relations, and mathematical notation will be assumed.