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.
This course is part of the Open Learning Library, which is free to use. You have the option to sign up and enrol in the course if you want to track your progress, or you can view and use all the materials without enrolling.