Fall 2025 - MACM 101 E100
Discrete Mathematics I (3)
Class Number: 5564
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 3 – Dec 2, 2025: Mon, 4:30–5:20 p.m.
SurreySep 3 – Dec 2, 2025: Wed, 4:30–6:20 p.m.
Surrey -
Exam Times + Location:
Dec 9, 2025
Tue, 7:00–10:00 p.m.
Surrey
-
Instructor:
Ryan Assari
maa154@sfu.ca
-
Prerequisites:
BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157.
Description
CALENDAR DESCRIPTION:
Introduction to graph theory, trees, induction, automata theory, formal reasoning, modular arithmetic. Quantitative/Breadth-Science.
COURSE DETAILS:
This course is an introduction to discrete mathematics. The course will focus on establishing foundational
principles of discrete mathematics and demonstrating their relevance through applications
in Computing Science. Emphasis will be placed on rigorous mathematical reasoning, problem solving,
and proof techniques.
By the end of the course, students will be able to:
• Understand and apply principles of propositional and predicate logic.
• Construct formal mathematical proofs using induction and other techniques.
• Work with sets, functions, relations, and equivalence classes.
• Analyze growth of functions and understand asymptotic notation.
• Understand the basics of number theory, including modular arithmetic.
• Apply graph-theoretic concepts in computing contexts.
Tentative Course Topics
1. Logic and Quantifiers
2. Set Theory and Operations
3. Proof Techniques: Direct, Contrapositive, Contradiction
4. Mathematical Induction and Recursive Definitions
5. Functions, Relations, and Equivalence Relations
6. Number Theory: Divisibility, Modular Arithmetic
7. Growth of Functions and Big-O Notation
8. Introduction to Graphs and Trees
Grading
NOTES:
Grading Scheme
Tutorial Participation (12 tutorials × 1%) 12%
Homework Assignments (10 assignments × 2%) 20%
Midterm 1 15%
Midterm 2 15%
Final Examination 38%
THE INSTRUCTOR RESERVES THE RIGHT TO CHANGE ANY OF THE ABOVE
INFORMATION.
Materials
MATERIALS + SUPPLIES:
Supplementary (Optional Reading):
Discrete and Combinatorial Mathematics: An Applied Introduction
- 5th Edition
- Ralph P. Grimaldi
- Addison-Wesley
- 2004
REQUIRED READING:
Discrete Mathematics and Its Applications
- 8th Edition
- Kenneth H. Rosen
- McGraw Hill
- 2018
ISBN: 9781260091991
REQUIRED READING NOTES:
Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.
Department Undergraduate Notes:
-
Students must attain an overall passing grade on the weighted average of exams in the course in order to get a C- or higher.
-
All student requests for accommodations for their religious practices must be made in writing by the end of the first week of classes, or no later than one week after a student adds a course. After considering a request, an instructor may provide a concession or may decline to do so. Students requiring accommodations as a result of a disability can contact the Centre for Accessible Learning (caladmin@sfu.ca).
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:
- SFU’s Academic Integrity Policy: S10-01 Policy
- SFU’s Academic Integrity website, which includes helpful videos and tips in plain language: Academic Integrity at SFU
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.