COMS W3203
DISCRETE MATHEMATICS
Lect: 3. Logic and formal proofs, sequences and summation, mathematical induction, binomial coefficients, elements of finite probability, recurrence relations, equivalence relations and partial orderings, and topics in graph theory (including isomorphism, traversability, planarity, and colorings)
Prerequisites & course information
Prerequisites: Any introductory course in computer programming.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- DISCRETE MATHEMATICS · 4.00 points · University catalogue