Principles of Discrete Applied Mathematics
This MIT OpenCourseWare course covers the discrete mathematics behind real-world algorithms and systems, including probability, counting techniques, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. Designated a Communication Intensive in the Major (CI-M) course at MIT, it includes a writing component alongside the technical material, so problem sets and assignments emphasize explaining mathematical reasoning clearly, not just producing answers. Materials available through OCW include lecture notes, assignments, and course structure as taught at MIT, free to access under a Creative Commons license. The course suits students who already have some grounding in discrete math and want to see how counting, coding theory, and optimization connect to practical computational problems like data compression and reliable transmission.