Simon Fraser University
Engaging the World

Course Outlines

Fall 2026 - MACM 201 D100

Discrete Mathematics II (3)

Class Number: 4419

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 9 – Dec 7, 2026: Mon, 12:30–1:20 p.m.
    Burnaby

    Sep 9 – Dec 7, 2026: Wed, Fri, 12:30–1:20 p.m.
    Burnaby

  • Prerequisites:

    MATH 141 or MACM 101 or (ENSC 251 and one of MATH 232 or MATH 240).

Description

CALENDAR DESCRIPTION:

A continuation of MACM 101. Topics covered include graph theory, trees, inclusion-exclusion, generating functions, recurrence relations, and optimization and matching.

COURSE DETAILS:

Topics
 
 Review of Basic Counting Techniques

  • Permutations
  • Combinations
  • Counting in Graphs

Probability
  • Review of Finite Probability
  • Conditional Probability
  • Random Variables and Expectation

Advanced Enumeration
  • Introduction to Generating Functions
  • Calculational Techniques 
  • Partitions of Integers (optional)

Recurrence Relations
  • First-Order Linear Recurrence Relations
  • Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients
  • Nonhomogeneous Recurrence Relations
  • The Method of Generating Functions 
  • Divide-and-Conquer Algorithms (optional)

Graph Theory
  • Definitions
  • Subgraphs, Complements, and Graph Isomorphism
  • Vertex Degree: Euler Trails and Circuits 
  • Planar Graphs
  • Hamilton Paths and Cycles
  • Graph Coloring and Chromatic Number (optional) 

Trees
  •  Characterizations of Trees and Prufer Codes
  •  Rooted Trees and Depth-First-Search Spanning Trees
  •  Articulation Points and Biconnected Components (optional)
  •  Minimum Spanning Trees: Kruskal's and Prim's Algorithms

Grading

  • Quizzes 10%
  • Midterm 1 20%
  • Midterm 2 20%
  • Final Exam 50%

NOTES:

The following is the default policy in the Department of Mathematics. Please check your course syllabus whether the instructor has chosen a different policy for your class, otherwise the following policy applies.
 
To receive a grade of C- or higher the student must receive a passing grade on the weighted average of exams in the course. What constitutes a passing grade is up to the discretion of the instructor, though the default is a grade of 50% or higher.

THE INSTRUCTOR RESERVES THE RIGHT TO CHANGE ANY OF THE ABOVE INFORMATION.
Students should be aware that they have certain rights to confidentiality concerning the return of course papers and the posting of marks.  Please pay careful attention to the options discussed in class at the beginning of the semester.

Materials

REQUIRED READING:

Discrete Combinatorial Mathematics: An Applied Introduction
5 / E
Ralph P. Grimaldi
Pearson Education
ISBN: 9780321385024

Department Undergraduate Notes:

Final Examinations: Students are expected to remain available for the entire final examination period published in the Academic Calendar. Travel, employment, and other personal commitments should be planned accordingly. Such commitments do not normally constitute grounds for alternative examination arrangements.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

At SFU, you are expected to act honestly and responsibly in all your academic work. Cheating, plagiarism, or any other form of academic dishonesty harms your own learning, undermines the efforts of your classmates who pursue their studies honestly, and goes against the core values of the university.

To learn more about the academic disciplinary process and relevant academic supports, visit: 


RELIGIOUS ACCOMMODATION

Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.