Mathematics for Computer Science
Free, no sign-up neededSpring 2024English
About this course
This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.
Description from MIT OpenCourseWare.
Where to take this course
- Open MIT OpenCourseWare (new tab)MIT OpenCourseWare · Spring 2024