Mathematics for Computer Science
As taught in: Spring 2010
The Fifteen Puzzle. See the Lecture 12 in-class problems for more information about this game. (Image courtesy of Nick Matsakis.)
Instructors:
Prof. Albert R. Meyer
MIT Course Number:
6.042J / 18.062J
Level:
Undergraduate
Course Description
This subject offers an 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.042, 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.
Syllabus
Course Meeting Times
Lectures: 3 sessions / week, 1.5 hours / session
Contents
Introduction
Considerations for Taking the Subject This Term
Problem Sets
Online Tutor Problems
Weekly Reading Comments
Biweekly Mini-quizzes
Final Exam
Collaboration
Grades
LaTeX Macros
Introduction
This subject offers an 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.
The prerequisite is 18.01 (first term calculus), in particular, some familiarity with sequences and series, limits, and
differentiation and integration of functions of one variable.
The