Fall 2019 - MACM 201 D200

Discrete Mathematics II (3)

Class Number: 10437

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo, We, Fr 12:30 PM – 1:20 PM
    SSCC 9001, Burnaby

  • Exam Times + Location:

    Dec 13, 2019
    8:30 AM – 11:30 AM
    GYM CENTRAL, Burnaby

  • Prerequisites:

    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. Quantitative.

COURSE DETAILS:

Advanced Probability

  • Review of Finite Probability 
  • Conditional Probability

Inclusion-Exclusion
  • The Principle of Inclusion-Exclusion (review)
  • Generalized Inclusion-Exclusion
  • Derangements  

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

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)  

Optimization and Matching
  • Review of Trees 
  • Dijkstra's Shortest-Path Algorithm 
  • Minimum Spanning Trees: Kruskal's and Prim's Algorithms 
  • Matching Theory (optional)

Grading

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

NOTES:


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

Registrar Notes:

SFU’s Academic Integrity web site http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS