# Principles of Discrete Applied Mathematics

A representation for Batcher's algorithm on 8 inputs; the color coding refers to sorting in groups of size 8 from groups of size 4. (Image by Michel Goemans.)

### Instructor(s)

Prof. Michel Goemans

Susan Ruff

Dr. Lorenzo Orecchia
Recitation Instructor

Dr. Richard Peng
Recitation Instructor

### MIT Course Number

18.310

### As Taught In

Fall 2013

### Level

Undergraduate

###

Some Description
Instructor(s) | Prof.
As Taught In | Spring 2002
Course Number | 2.24
Level | Undergraduate/Graduate
Features | Lecture Notes, Student Work

## Course Description

## Course Features

- Lecture notes
- Assignments: problem sets (no solutions)
- Assignments: written (no examples)

## Educator Features

- Instructor insights

## Course Description

This course is an introduction to discrete applied mathematics. Topics include probability, counting, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. This is a Communication Intensive in the Major (CI-M) course, and thus includes a writing component.

## Other Versions

## Other OCW Versions

Archived versions:

- 18.310C Principles of Applied Mathematics (Fall 2007)
- 18.310 Principles of Applied Mathematics (Fall 2004)
- 18.310 Principles of Applied Mathematics (Fall 2002)

## Related Content

## Course Collections

See related courses in the following collections:

### Cross-Disciplinary Lists

- Transportation Courses

### Find Courses by Topic

- Applied Mathematics
- Probability and Statistics
- Communication
- Discrete Mathematics

Michel Goemans, Susan Ruff, Lorenzo Orecchia, and Richard Peng. 18.310 Principles of Discrete Applied Mathematics. Fall 2013. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu. License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.