Introduction to counting, induction, automata theory, formal reasoning, modular arithmetic. Quantitative/Breadth-Science.
This course is an introduction to discrete mathematics. The course will focus on establishing basic principles and motivate the relevance of those principles by providing examples of applications in Computing Science.
- Logic and Quantifiers
- Set Theory
- Formal Reasoning and Induction
- Functions and Relations
- Number Theory
- Trees (if time permits)
There will be several graded assignments, one or two midterms and a final exam. The details will be discussed in the first week of classes.
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).
Discrete and Combinatorial Mathematics (an Applied Introduction) (Paperback)
Ralph P. Grimaldi
Discrete Mathematics and Its Applications, 7th Edition (Looseleaf Version)
K. H. Rosen, McGraw Hill, 2011 (Hardcover Edition - 9780073383095)
SFU’s Academic Integrity web site http://students.sfu.ca/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
Course Times + Location:
Tu 10:30 AM – 11:20 AM
SWH 10081, Burnaby
Th 9:30 AM – 11:20 AM
DFA 300, Burnaby
Exam Times + Location:
Dec 12, 2017
8:30 AM – 11:30 AM
SSCC 9001, Burnaby
Prerequisites:BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157.
DISCRETE MATHEMATICS I
MACM 101 (Spring, 2018)
General InformationInstructor: Steven Pearce (TASC-1 9225, Burnaby Campus)
E-mail: stevenp AT sfu.ca - Emergencies Only
- One hour BEFORE class on Thursday.
- TAs: Nastaran Hajinazar, Hiral Patwa and Inderpreet Singh (LAB HOURS CAN BE FOUND AT SIMS).
Text: Discrete and Combinatorial Mathematics, by Grimaldi
Prerequisites/Corequisites: BC High School Math 12. A minimum grade of C is required in all prerequisite courses.
LATE POLICY: 25%/day (not accepted more than two days late)
Note that you only have one week to review examinations and homework assignments after receipt.
Homework (10%) - Roughly every two weeks (announced in class)
Midterm Examination #1 (25%) - Fifth Week (Tentative)
Midterm Examination #2 (25%) - Tenth Week (Tentative)
Final Examination (40%) - April 20th, 2018 at 08:30hrs.
You can keep track of your grades on our new grade-tracking webpage located at http://courses.cs.sfu.ca (to be dicussed).
Tentative Schedule of Lectures
Administration and Introduction to course
Overview of Discrete Mathematics (class notes)
Introduction to Combinatorics (1.1-1.3)
Cominatorics continued (1.3-1.4)
NOTES ON COMBINATORICS
Propositional Logic (2.1)
The Laws of Logic (2.2)
Rules of Inference (2.3)
NOTES ON PROOFS
Quantifiers and Methods of Formal Proofs (2.3-2.5 and my notes)
MIDTERM #1(50 minutes)
Set Theory (3.1-3.3).
Inclusion/Exclusion Principle (8.1 class notes only)
Mathematical Induction (4.1)
WE WILL NOT BE EXPLICITLY COVERING THESE SECTIONS (MY NOTES ONLY, PLEASE)
Number Theory (4.3-4.4; know enough for applying proof templates)
Relations and Functions (5.1-5.3, 5.6)
NOTE: INVERSE AND COMPOSITE FUNCTIONS FROM CLASS NOTES ONLY
Computational Complexity (5.7-5.8; mostly rely on my notes)
MIDTERM #2 (50 minutes)
Computational Complexity continued
Graph Theory (Introduction from Chapter 11 and mostly from Chapter 12 - sections to be announced)
NOTE: There is an introductory PPT for most sections.