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
Mathematics for Computer Science (MIT 6.042J)
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
Mathematics for Computer Science, video lectures (MIT 6.042J, Fall 2010)
Tom Leighton, Marten van Dijk
Lectures 4–17: number theory, graphs, relations, sums, recurrences, counting
Practise
Other options
- Project Euler (practise)
Problems 1–50
Wrong chapter, dead link, or know something better? Tell us on GitHub.
Which roles ask for it
- GATE computer science to get hired
- UGC NET computer science to get hired
Before and after
Learn first
Discrete maths