Lecture Notes | Principles of Discrete Applied Mathematics | Mathematics | MIT OpenCourseWare

Course Info

Instructors

Departments

Mathematics

As Taught In

Spring 2024

Level

Undergraduate

Topics

Learning Resource Types

Lecture Videos

Lecture Notes

Problem Sets

Editable Files

Download Course

Lecture Notes

18.200 (S24), Lecture 01: Pigeonhole Principle

18.200 (S24), Lecture 02–04: Probability Theory

18.200 (S24), Lecture 05–06: Counting

18.200 (S24), Lecture 07–08: Generating Functions

18.200 (S24), Lecture 09–10: Tail Bounds: Chebyshev, WLLN and Cherno

18.200 (S24), Lecture 11–12: Network Flows and Matching

18.200 (S24), Lecture 15: Modular Arithmetic and Elementary Algebra

18.200 (S24), Lecture 17: Linear Programming: Basics

18.200 (S24), Lecture 18: Data Compression & Shannon’s Entropy Theorem

18.200 (S24), Lecture 19: Huffman Codes

18.200 (S24), Lecture 20: Error Correction and Shannon’s Noisy Coding Theorem

18.200 (S24), Lecture 21–22: Linear Error-Correcting Codes

18.200 (S24), Lecture 23–24: Cryptography, RSA and Secret Sharing

Course Info

Instructors

Departments

Mathematics

As Taught In

Spring 2024

Level

Undergraduate

Topics

Learning Resource Types

Lecture Videos

Lecture Notes

Problem Sets

Editable Files

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2025 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2025 Massachusetts Institute of Technology