Mathematics for Computer Science

Course Features

• Video lectures
• Captions/transcript
• Assignments: problem sets (no solutions)
• Exams and solutions

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.

Other OCW Versions

OCW has published multiple versions of this subject.

• 6.042J Mathematics for Computer Science (Spring 2015)
• 6.042J Mathematics for Computer Science (Fall 2005)

Course Collections

See related courses in the following collections:

Find Courses by Topic

• Computer Science
• Probability and Statistics
• Applied Mathematics
• Discrete Mathematics

MIT Crosslinks

Explore the topics covered in this course with MIT Crosslinks, a website that highlights connections among select MIT undergraduate STEM courses and recommends specific study materials from OCW and others. Learn more.