Prof. Albert R. Meyer
Prof. Adam Chlipala
MIT Course Number
6.042J / 18.062J
As Taught In
- Video lectures
- Interactive assessments
- Online textbooks
- Lecture notes
- Assignments: problem sets (no solutions)
- Exams (no solutions)
- Resource Index
This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds:
- Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations.
- Discrete structures: graphs, state machines, modular arithmetic, counting.
- 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:
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)