0
(
ratings
)
1
students
Created by:
Last updated:
December 12, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
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.
Course Curriculum
- Probability Theory Unlimited
- Pigeonhole Principle Unlimited
- Probabilistic Method – Van der Waerden’s Theorem Unlimited
- Chernoff Bounds Unlimited
- Sequential Choice Unlimited
- Counting, Coding, Sampling Unlimited
- Generating Functions Unlimited
- Linear Programming Unlimited
- Network Flows Unlimited
- Sorting Unlimited
- Median Finding Unlimited
- Median Finding and QUICKSORT Unlimited
- Sorting Networks Unlimited
- Modular Arithmetic and Elementary Algebra Unlimited
- Cryptography Unlimited
- Factoring Unlimited
- FFT (Fast Fourier Transform) Unlimited
- Shannon’s Noiseless Coding Theorem Unlimited
- Huffman Codes Unlimited
- Lempel-Ziv Codes Unlimited
- Shannon’s Noisy Coding Theorem Unlimited
- Linear Codes Unlimited
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
Massachusetts Institute of Technology
