Coursera
PaidIntroduction to Discrete Mathematics for Computer Science
A puzzle- and programming-based introduction to proofs, combinatorics, probability, graph theory, and mathematical reasoning for computing.
Hania Uscka-Wehlou and Martin Wehlou
Explore this extended discrete-mathematics course for logic, implications, set theory and worked reasoning, with independent-proof guidance.
Opens on the provider’s site. Check current access and certificate terms there.
Hania Uscka-Wehlou and Martin Wehlou develop discrete reasoning through explanations and a large worked-problem sequence. Logic, implications and necessary or sufficient conditions connect with elementary set theory. The course is useful for learners who want to justify a step and recognize the structure of an argument rather than memorize a result without knowing when it applies.
Compare the introductory explanations with your mathematical background. The long sequence requires time for independent attempts, especially when formal proof is unfamiliar.
The page was updated in August 2026. A correct-looking example is not proof of a general claim. Keep definitions explicit, test boundary cases and distinguish a counterexample from evidence supporting only a few instances.
Udemy offers paid purchase or subscription access depending on the course and region. Paid teaching courses provide completion certificates under Udemy’s policy. Check current enrollment terms and any separate software, account or materials costs.
Write a small claim using sets or logical conditions and attempt a proof before viewing a solution. Test a boundary case, identify the exact step that needs justification and revise the statement if a counterexample appears.
This overview is based on the provider's published information, checked on . It is an editorial assessment, not a claim that we completed the resource. Time filters are approximate study ranges; projects and exercises can take longer.
When no formal provider level is given, the level filter is an editorial estimate based on the published audience and requirements. Time filters use the listed video runtime; independent exercises can take longer.
View the curriculum and current access options at Udemy.
How YellowCourse describes and checks learning resources.
Other learning resources covering the same topic.
Coursera
PaidA puzzle- and programming-based introduction to proofs, combinatorics, probability, graph theory, and mathematical reasoning for computing.
Coursera
PaidExplore Georgia Tech’s course on games without chance, with mathematical comparisons, impartial games and guidance on analyzing small…
Coursera
FreeExplore Princeton’s free analytic-combinatorics course on generating functions, complex analysis and asymptotic counting, without a…
Coursera
PaidExplore Stanford’s mathematical-thinking course on precise language, logic and proofs, with practice moving beyond procedural school…
Coursera
PaidExplore CUHK’s discrete-optimization course on MiniZinc, sets, functions and alternative models for practical constraint problems.
Coursera
PaidExplore CUHK’s further MiniZinc course on debugging, predicates, scheduling, packing and techniques for improving discrete-optimization…
Took this course? Share what you thought.