6.042J / 18.062J Mathematics for Computer Science

Spring 2005

Numbers sequence.

Numbers sequence. (Image courtesy of David Wise. Used with permission.)

Course Highlights

This course features a full set of lecture notes and problem sets. In addition, recitation assignments are also featured.

Course Description

This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.
Donate Now

Staff

Instructors:
Prof. Srinivas Devadas
Dr. Eric Lehman

Contributors:
Prof. Albert Meyer
Prof. Charles Leiserson

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Recitations:
Two sessions / week
1 hour / session

Level

Undergraduate