18.310 - Fall 2007

 

Lecturers:  Professor Daniel Kleitman     e-mail: djk@math.mit.edu

                   Professor Peter Shor     e-mail: shor@math.mit.edu

Teaching Assistants:  The teaching assistants will be alternating holding office hours, but at least one of them will hold office hours each week. We eventually may settle down to a regular schedule, but until then, please look on the web for the time, place, and TA.

Lectures:   MWF 12-1   in   Room 4-270


Announcements:

Students may now view grades and feedback from the graders, and submit files on the Stellar website http://stellar.mit.edu/S/course/18/fa07/18.310C/ .

Exam:

The first exam will be held Friday, Oct. 12. There will be an in-class part, and a take-home part which involves constructing a spreadsheet. Notes are allowed for the in-class part as long as they are in your handwriting. There are now sample questions for the exam posted. (Most of the exam questions will be easier than the hardest sample questions, so don't be scared). The Wednesday, Oct. 10 class will be an exam review.


Course Description

Principles of Discrete Applied Mathematics is a study of illustrative topics in discrete applied mathematics including sorting algorithms, information theory, coding theory, secret codes, generating functions, Fourier Transforms, linear programming, game theory. There is an emphasis on topics that have direct application in the real world.

 

General Information

Syllabus

Problem Sets

Exams (Now updated with information for exam on Friday, October 12)

FAQ

Papers

Lecture Notes

 

Past 18.310:

This is the directory which contains 18.310 taught in Fall 2004

This is the directory which contains 18.310 taught in Fall 2005

This is the directory which contains 18.310 taught in Fall 2002