Fall 2026 - MACM 101 D200

Discrete Mathematics I (3)

Class Number: 4936

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 9 – Dec 6, 2026: Tue, 8:30–10:20 a.m.
    Surrey

    Sep 9 – Dec 6, 2026: Thu, 8:30–9:20 a.m.
    Surrey

  • Prerequisites:

    BC Pre-Calculus 12 or BC Calculus 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.

COURSE DETAILS:

This course is an introduction to discrete mathematics. The course will focus on establishing basic discrete mathematics principles and motivate the relevance of those principles by providing examples of applications in Computing Science. 

Topics

  • Counting
  • Logic and Quantifiers
  • Set Theory
  • Formal Reasoning and Induction
  • Functions and Relations
  • Number Theory
  • Graphs and Trees
  • Growth of Functions

Grading

  • There will be several graded assignments, quizzes, one or two midterms and a final exam. The details will be discussed in the first week of classes. Students must pass the final exam in order to pass the course. Students must attain an overall passing grade on the weighted average of exams in the course in order to obtain a clear pass (C- or better).

REQUIREMENTS:

The following are default policies in the School of Computing Science. Please check your course syllabus whether the instructor has chosen a different policy for your class, otherwise the following policies apply.

  • Students must attain an overall passing grade on the weighted average of exams in the course in order to get a D 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).
  • Use of AI tools by students for completing graded scholarly activities and course submissions that has not been explicitly authorized by the instructor  will be considered as plagiarism under SFU’s Code of Academic Policy (http://www.sfu.ca/policies/teaching/t10-02.htm).  Following this policy, instructors will report all instances of plagiarism to the academic integrity board.  

Materials

REQUIRED READING:

Discrete and Combinatorial Mathematics (an Applied Introduction)
Ralph P. Grimaldi
Addison-Wesley
5th Edition
2004
ISBN: 9780201726343

RECOMMENDED READING:

Discrete Mathematics and Its Applications
K. H. Rosen
McGraw Hill
8th Edition
2018
Ebook available: 9781260912784
ISBN: 9781259676512

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.