Appearance
MIT 6.042J: Discrete Mathematics
Course Overview
University: MIT
Course Code: 6.042J
Instructor: Tom Leighton, Marten van Dijk
Status: Not Started
Progress: 0/35 lectures
A comprehensive study of the mathematical structures at the heart of computer science.
Resources
📚 MIT 6.042J OpenCourseWare
📺 Video Lectures
📖 Textbook (PDF)
Key Topics
- Proofs and mathematical reasoning
- Induction and recursion
- Number theory
- Combinatorics
- Probability and randomness
- Graph theory and trees
- Directed acyclic graphs
- Recurrence relations
- Asymptotic notation
Why This Matters
Discrete mathematics is everywhere in CS:
- Algorithms: Analyzing complexity and correctness
- Combinatorics: Counting possibilities efficiently
- Probability: Understanding randomized algorithms
- Graph theory: Modeling networks and systems
- Number theory: Cryptography and security
Learning Goals
By the end of this course, you should be able to:
- Construct clear proofs using various techniques
- Apply induction to solve problems
- Count possibilities using combinatorial methods
- Analyze probability and randomness
- Work with graphs and trees
- Solve recurrence relations
Study Plan
Estimated Time: 5-7 hours/week for 12-14 weeks
- Lectures: ~3 hours/week
- Problem Sets: ~3-4 hours/week
- Exams: ~1-2 hours/week (practice)
Daily Notes
Lecture 1-5: Proofs
- [ ] Lecture 1: Intro to Discrete Math
- [ ] Lecture 2: Proofs
- [ ] Lecture 3: Induction
- [ ] Lecture 4: Strong Induction
- [ ] Lecture 5: Well Ordering
Problem Sets
Important Formulas & Concepts
Key Takeaways
← Previous: CS103 | [← Back to Spring Quarter](Online Studying/CS - Stanford, MIT, Berkley/Year 1/Spring Quarter/index.md) | Next Course: Missing Semester →