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.
The Chinese University of Hong Kong — Prof. Jimmy Ho Man Lee
Explore CUHK’s further MiniZinc course on debugging, predicates, scheduling, packing and techniques for improving discrete-optimization models.
Opens on the provider’s site. Check current access and certificate terms there.
CUHK extends discrete-optimization modeling with debugging, reusable predicates and more demanding scheduling and packing problems. Symmetry and dominance provide ways to reconsider how a model searches for solutions. It suits learners who can already formulate basic constraints and want to make their models easier to inspect, maintain and solve.
Learners with basic constraint-modeling experience, or preparation equivalent to the preceding modeling course. The provider labels this course intermediate despite its advanced title.
Work through examples with a written argument rather than relying on an answer alone. Check definitions, quantifiers and boundary cases, and distinguish a model’s assumptions from the situation it represents. These courses take different routes through discrete mathematics; compare their preparation requirements and topic coverage before choosing a starting point.
Coursera offers paid enrollment or subscription access. Check the enrollment screen for assessment and certificate terms, trials and any financial-aid options. Provider access terms can change; review them before paying.
Revisit a small optimization model and introduce a redundant or inconsistent constraint deliberately. Diagnose the result, document the correction and compare an alternative formulation.
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.
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 Case Western’s course on proof methods, quantifiers, contradiction and induction, with a systematic approach to constructing…
Took this course? Share what you thought.