Discrete Mathematics 2 (MATH 2120)
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.
Course code: MATH 2120
Credits: 3.0
Tuition: $0
Length: 60.0 hours
Course outline:
view
https://www.vcc.ca/vccphp/courseoutline?subject=MATH&number=2120
Prerequisites
MATH 1120 Discrete Mathematics 1. No schedule is currently available. Please check again later.
0
Additional Information
- • 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
This course is offered as part of a VCC program only.
Ask a question
* The amount shown is the approximate cost of tuition (for courses with tuition) or fees (for courses that do not have tuition).
Tuition and Fees are approximate and subject to change. Students are required to pay any applicable fee increases. Fees listed are for domestic students. For international programs, visit VCC International.
† 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.