0

(

ratings

)

2

students

Created by:

Profile Photo

Last updated:

December 1, 2022

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

Description

This course covers elementary discrete mathematics for computer science and engineering.

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 Curriculum

  • 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

About the instructor

5 5

Instructor Rating

1

Reviews

1520

Courses

1915

Students

Profile Photo
Massachusetts Institute of Technology