Spring 2022 - MACM 201 D100
Discrete Mathematics II (3)
Class Number: 6902
Delivery Method: In Person
Overview
-
Course Times + Location:
Jan 10 – Apr 11, 2022: Mon, Wed, Fri, 12:30–1:20 p.m.
Burnaby -
Exam Times + Location:
Apr 24, 2022
Sun, 7:00–10:00 p.m.
Burnaby
-
Instructor:
Bojan Mohar
mohar@sfu.ca
1 778 782-4233
-
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:
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 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:
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS
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
TEACHING AT SFU IN SPRING 2022
Teaching at SFU in spring 2022 will involve primarily in-person instruction, with safety plans in place. Some courses will still be offered through remote methods, and if so, this will be clearly identified in the schedule of classes. You will also know at enrollment whether remote course components will be “live” (synchronous) or at your own pace (asynchronous).
Enrolling in a course acknowledges that you are able to attend in whatever format is required. You should not enroll in a course that is in-person if you are not able to return to campus, and should be aware that remote study may entail different modes of learning, interaction with your instructor, and ways of getting feedback on your work than may be the case for in-person classes.
Students with hidden or visible disabilities who may need class or exam accommodations, including in the context of remote learning, are advised to register with the SFU Centre for Accessible Learning (caladmin@sfu.ca or 778-782-3112) as early as possible in order to prepare for the spring 2022 term.