This course is a continuation of MATH 1120 (Discrete Mathematics 1). It introduces students to more advanced topics in graph theory, inclusion and exclusion, recurrence relations, generating functions, optimization and matching, with an emphasis on applications in computer science.
Prerequisites
MATH 1120 Discrete Mathematics 1.
Missing prerequisites?
Learn more about VCC's academic upgrading or English as a Second Language (ESL) courses, or discover which university transfer options are right for you.
What you will learn
- • Inclusion-exclusion: The principle of inclusion-exclusion (review); Generalized inclusion-exclusion; Derangements
• Generating functions: Introduction to generating functions; Computational techniques; Inverses; Rational generating functions; Partitions of integers; Coefficient extraction
• Recurrence relations: General form of linear recurrence relations; First-order linear recurrence relations; Second-order linear homogeneous relations; Nonhomogeneous recurrence relations; Solutions via method of undetermined coefficients; Solutions via generating functions
• Graph theory: Review; Euler trails and circuits; Planar graphs; Hamilton paths and cycles; Graph coloring and chromatic number
• Optimization and matching: Review of trees; Dijkstra's shortest-path algorithm; Minimum spanning trees: Kruskal's and Prim's algorithms; Matching theory
How to register
This course is offered as part of a VCC program only.
Course schedules
Select your program to see the available course schedules.
| CRN# | Duration | Delivery | Location | ||
|---|---|---|---|---|---|
| 61005 |
May 4, 2026 to August 21, 2026 |
Lecture Online |
Varies | See full schedule | Register |
Online courses listed without scheduled meeting times can be completed on your own schedule.
Contact us
If you have any question, please email at advising@vcc.ca.
† This information is intended as a guideline only. Program and course details are subject to change with the approval of VCC's Board of Governors.