GIVE NOW about ocw help & faqs contact us
18.200 | Spring 2024 | Undergraduate

# Principles of Discrete Applied Mathematics

##### Lecture 1: Pigeonhole Principle

##### Lecture 2: Independence and Conditioning

##### Lecture 3: Inclusion-Exclusion

##### Lecture 4: Counting

##### Lecture 5: More Counting and Generating Functions

##### Lecture 6: More on Generating Functions

##### Lecture 7: Generating Functions for Catalan Numbers

##### Lecture 8: Tail Bounds

##### Lecture 9: Chernoff Bounds

##### Lecture 10: Modular Arithmetic

##### Lecture 11: Basic Group Theory

##### Lecture 12: Introduction to Linear Programming

##### Lecture 13: Duality in Linear Programming

##### Lecture 14: Zero-Sum Games

##### Lecture 15: Max-Flow Min-Cut Theorem

##### Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem

##### Lecture 17: Huffman Coding

##### Lecture 18: Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem

##### Lecture 19: Error-Correcting Codes—Hamming Codes

##### Lecture 20: Reed-Solomon Codes

## Course Info

##### Instructors

- Prof. Ankur Moitra
- Prof. Peter Shor
- Susan Ruff

##### Departments

- Mathematics

##### As Taught In

Spring 2024

##### Level

Undergraduate

##### Topics

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

##### Learning Resource Types

theaters Lecture Videos
notes Lecture Notes
assignment Problem Sets
Editable Files

Browse Resources

# You are leaving MIT OpenCourseWare

Please be advised that external sites may have terms and conditions, including license rights, that differ from ours. MIT OCW is not responsible for any content on third party sites, nor does a link suggest an endorsement of those sites and/or their content.