Mathematics for Computer Science
About This Course
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 brought to you by MIT OpenCourseWare, and provided under our Creative Commons License. It is also available for study on the OCW website.
Recommended Prerequisites
Familiarity with sequences and series, limits, and differentiation and integration of functions of one variable are necessary. This is taught in 18.01 Single Variable Calculus (OCW).
Instructors
Albert Meyer
Hitachi America Professor of Computer Science
Instructor in the Department of Electrical Engineering and Computer Science.
Adam Chlipala
Professor of Research and Development
Instructor in the Department of Electrical Engineering and Computer Science.