Explore discrete-mathematics courses for computer-science reasoning, logic, counting, and structured problems, with guidance on proofs and prerequisites.
1 learning resource in this collection
Discrete mathematics develops reasoning about structures used in computer science. Logic, counting, relationships, and proof support more than one programming language. It is useful to learn how a conclusion follows rather than recognize a formula alone.
Check algebra and programming expectations before a specialization. Attempt problems before reading the solution and write the justification in words. A proof needs every step to follow from a stated assumption or earlier result.
Solve a small counting or logic problem in two ways. Explain why both approaches agree and identify the assumption that would invalidate the reasoning.
Coursera · University of California San Diego
A puzzle- and programming-based introduction to proofs, combinatorics, probability, graph theory, and mathematical reasoning for computing.