18.310 | Fall 2013 | Undergraduate

Principles of Discrete Applied Mathematics

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 …
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.
Learning Resource Types
Problem Sets
Lecture Notes
Written Assignments
Instructor Insights
A graphic showing a collection of parallel and perpendicular lines of various colors.
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.)