Home » Course Layouts » Free Course Layout Udemy

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

0

2

English

English [CC]

FREE

Description

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 content

  • 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

N.A

0 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

Instructor

Massachusetts Institute of Technology
Profile Photo
5 5
1
1916
1520

Explore Free Courses

Access valuable knowledge without any cost.