Maths foundations

Discrete maths

Logic, sets, relations, counting, graphs and recurrences. Most of algorithms rests on this.

About 40 hours of study.

Where to learn it

Read

Eric Lehman, Tom Leighton, Albert Meyer

Parts II and III: Structures, Counting

The course text is a free PDF on the course page.

Section not checked yet

Watch

Tom Leighton, Marten van Dijk

Lectures on number theory, graphs, counting and recurrences

Section not checked yet

Practise

No practice set picked yet.

Discrete maths