2
This course covers elementary discrete mathematics for computer science and engineering.
FREE
This course includes
Units & Quizzes
25
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions
Course Currilcum
- Introduction and Proofs Unlimited
- Induction Unlimited
- Strong Induction Unlimited
- Number Theory I Unlimited
- Number Theory II Unlimited
- Graph Theory and Coloring Unlimited
- Matching Problems Unlimited
- Graph Theory II: Minimum Spanning Trees Unlimited
- Communication Networks Unlimited
- Graph Theory III Unlimited
- Relations, Partial Orders, and Scheduling Unlimited
- Sums Unlimited
- Sums and Asymptotics Unlimited
- Divide and Conquer Recurrences Unlimited
- Linear Recurrences Unlimited
- Counting Rules I Unlimited
- Counting Rules II Unlimited
- Probability Introduction Unlimited
- Conditional Probability Unlimited
- Independence Unlimited
- Random Variables Unlimited
- Expectation I Unlimited
- Expectation II Unlimited
- Large Deviations Unlimited
- Random Walks Unlimited
Massachusetts Institute of Technology
5
⭐ Instructor rating
Followers
0
Following
0
Groups
0
Friends
0
