# Spring 2021 - MACM 201 D300

## Overview

• #### Course Times + Location:

Mo, We, Fr 12:30 PM – 1:20 PM
REMOTE LEARNING, Burnaby

• #### Exam Times + Location:

Apr 24, 2021
7:00 PM – 10:00 PM
REMOTE LEARNING, 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:

This course will be delivered online. You are expected to have access to a reliable internet connection. You will need a computer from which you can download course materials and activities and watch live and/or recorded lectures and participate in live tutorials or workshops.

You will need a camera to take photographs of your work. A phone is acceptable.

Topics

Review of Basic Counting Techniques

• Permutations
• Combinations
• Counting in Graphs

Probability
• Review of Finite Probability
• Conditional Probability
• Random Variables and Expectation
• 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)
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

#### Course Delivery

•  Lecture: synchronous- lectures will be held at fixed times, on-line
•  Midterm(s): synchronous; date: TBA
•  Final exam: synchronous; date: TBA

• Assignments 15%
• Midterm 1 15%
• Midterm 2 15%
• Midterm 3 15%
• Final Exam 40%

#### 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

#### MATERIALS + SUPPLIES:

Required:

• Ability to scan documents (homework/exams) (phone app acceptable)

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