Discrete Mathematics

The math of countable things: logic, sets, relations, combinatorics, graphs and proofs. The native language of CS theory.

intermediate~40 hours13 topics~26h of lessonsRoadmap Level 2

CS proofs, algorithms and ML are all math under the hood; the notation pays off everywhere.

Learning Path
07 stages
13 topics · 7 stages0/13 completed
01

Fundamentals

Start from zero. Build the vocabulary.

Propositional Logic~75 minbeginnerSets, Relations and Functions~90 minbeginnerProof Techniques~90 minintermediate
02

Core Concepts

The ideas you cannot skip.

Combinatorics: Counting and Permutations~90 minintermediateGraph Theory~90 minintermediateRecurrence Relations~90 minintermediate
03

Intermediate

Connect ideas and go deeper.

Generating Functions~90 minadvancedFormal Languages and Automata~120 minadvanced
04

Advanced

Beyond the basics.

Number Theory for CS~90 minadvancedComputability and Complexity (P vs NP)~90 minadvanced
05

Practice

Solve problems until it sticks.

Practice Set: Proofs and Counting~180 minintermediate
06

Projects

Apply everything in real work.

Project: Simple Proof Checker~360 minadvanced
07

Interview Prep

Convert knowledge into offers.

Discrete Math Interview Questions~90 minadvanced