Mathematics for Computer Science

Course Description

This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions. — Course material by Prof. Tom Leighton, MIT OpenCourseWare, used under CC BY-NC-SA 4.0. Original: https://ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-fall-2010/