1
Information

Syllabus

Calendar

2
Video Lectures

Lecture 1: Introduction and Proofs

Lecture 2: Induction

3
Assignments

Assignment 1

Education

Mathematics for Computer Science

Four dice representing the course number 6.042.

6.042 course logo. (Image by Will Drevo. Used with permission.)

Instructor(s)

Prof. Tom Leighton

Dr. Marten van Dijk

MIT Course Number

6.042J / 18.062J

As Taught In

Fall 2010

Level

Undergraduate

Cite This Course

 

 

Course Features

Course Description

This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

 

Other OCW Versions

OCW has published multiple versions of this subject. Question_OVT logo

 

Share