Princeton University
Computer Science Department

Computer Science 341
Discrete Mathematics

Moses Charikar

Fall 2002

General Information    Handouts

Course Summary

This course in an introduction to discrete mathematics, particularly to those branches that are useful in computer science. Topics include combinatorics, probability, algorithms, and rudiments of computation theory. Prerequisites: MAT 103 and MAT 104.

Textbook (changed from last year)

We have made arrangements to photocopy the textbook for students who do not have the text yet. Copies will be available at Triangle, 150 Nassau Street (Tel: 609 924 4630) for $35 beginning Monday. They are open M-F 8am-6pm. Also, the bookstore is supposed to receive one additional copy of the book sometime soon. 

Required Text: 
Invitation to Discrete Mathematics
Jiri Matousek and Jaroslav Nesetril
Oxford University Press
ISBN 0-19-850207-9

Optional Reference:
Discrete Mathematics and Its Applications, 4th edition
Kenneth H. Rosen
McGraw Hill
ISBN 0-07-289905-0

Administrative Information

Lectures: MW 3:00-4:20, Room: 104 Computer Science Building

Problem Session (optional): M 5:00-6:00, 105 Computer Science Building
                                               F  3:30-4:30, 105 Computer Science Building

Professor: Moses Charikar - 305 CS Building - 258-7477
                  Office hours: Tue 2:30-4:30

Secretary: Mitra Kelly - 323 CS Building - 258-4562

Undergraduate Coordinator: Tina McCoy - 410 CS Building - 258-1746

Teaching Assistants:

Course mailing list:

All students should subscribe to the course mailing list. We will use this to send out important announcements. To subscribe, send mail to with the text "subscribe cs341" in the body of the message.