6.042J/18.062J: Mathematics for Computer Science (Fall 1995)

Lecturers

David R. Karger
Room NE43-322
karger@theory.lcs.mit.edu
Telephone: (617) 258-6167

F. Tom Leighton
Room 2-377
Telephone: (617) 253-3662
Room NE43-328
Telephone: 253-5880
ftl@theory.lcs.mit.edu

Class Notes

Problem Sets

Texts

Required: Kenneth H. Rosen. Discrete Mathematics and Its Applications, third edition. McGraw Hill, 1995.

Recommended:

Course description

Prereq.: 18.02 or 18.023 or 18.024
U(1, 2) 5-0-7

Mathematical tools and methods for computer science and engineering. Emphasis on development of rigorous thinking, analytical skills, and mathematical sophistication while learning elementary discrete mathematics. Topics: mathematical proofs; induction and well-ordering; divisibility and congruences; asymptotic notation and growth of functions; sets, relations, functions, and graphs; counting theory; recurrences and generating functions; discrete probability.