18.310 - Fall 2008

 

Lecturers:  Professor Daniel Kleitman     e-mail: djk@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.

Lectures:   MWF 12-1   in   Room 4-270


Announcements:

Students will soon be able to view grades and feedback from the graders and submit files on the Stellar website (link to Fall 2007 subject site).

Exam:

The first exam will be held in October (date TBA). 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 sample questions for the exam. (Most of the exam questions will be easier than the hardest sample questions, so don't be scared). A class in October 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 (Fall 2007)

Syllabus

Problem Sets

Exams

FAQ

Papers

Lecture Notes

 

Past 18.310:

This is the directory which contains 18.310 taught in Fall 2005

This is the directory which contains 18.310 taught in Fall 2004

This is the directory which contains 18.310 taught in Fall 2002