Discrete Mathematics
The math of computer science: logic, proofs, sets, counting, and graphs — reasoning about discrete structures.
Prof. Marcus Oduya
Professor of Discrete Mathematics
Logic & Truth Tables
Reason precisely about true and false.
Sets & Counting
Combine and count without listing everything.
Graphs & Networks
Model connections as vertices and edges.
Common questions
Who is "Discrete Mathematics" for?
It is written for learners at Undergraduate level (College), and for anyone older who wants a clear refresher on mathematics. The math of computer science: logic, proofs, sets, counting, and graphs — reasoning about discrete structures. There is no application or entry test — you can start the first lesson straight away.
How long does the course take?
There are 3 lessons totalling 30 minutes of reading and quizzes, laid out over 3 units. You can move at your own pace — progress is saved as you go.
What do I need to know before starting?
No prior coursework is assumed. The course opens with "Logic & Proof", covering propositions and truth tables and direct proof, so the foundations are built in rather than expected.
Is the course free?
Yes. Every course on Monster Class is completely free, with no credit card, trial period or paywall. Creating a free account simply saves your progress, XP and place on the leaderboard across devices.