Mathematics for Computer Science
MIT Learn · intermediate
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.
Skills covered
Disclaimer
Suggestions only — review each course yourself to judge whether it meets the role's requirements. Completing a course doesn't guarantee proficiency or that you'll qualify; hiring standards vary by employer.
We may earn a commission through some course links.