Mathematics for Computer Science

Course Features

• Video lectures
• Captions/transcript
• Interactive assessments
• Online textbooks
• Lecture notes
• Assignments: problem sets (no solutions)
• Exams (no solutions)
• Resource Index

Course Description

This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds:

1. Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations.
2. Discrete structures: graphs, state machines, modular arithmetic, counting.
3. Discrete probability theory.

On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.

Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.

Open Learning Library Versions

MIT Open Learning Library offers a free version of this subject:

• 6.042J Mathematics for Computer Science

Other OCW Versions

OCW has published multiple versions of this subject.

• 6.042J Mathematics for Computer Science (Fall 2010)
• 6.042J Mathematics for Computer Science (Fall 2005)

Archived versions:

• 6.042J Mathematics for Computer Science (Spring 2010)
• 6.042J Mathematics for Computer Science (SMA 5512) (Fall 2002)

This course is also available in an alternative format on the MIT Open Learning Library.

Course Collections

See related courses in the following collections:

Find Courses by Topic

• Computer Science
• Applied Mathematics
• Probability and Statistics

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.