Fall 2019 - MACM 101 D300
Discrete Mathematics I (3)
Class Number: 9360
Delivery Method: In Person
Course Times + Location:
Mo, We, Fr 12:30 PM – 1:20 PM
SUR 5280, Surrey
Exam Times + Location:
Dec 8, 2019
12:00 PM – 3:00 PM
1 778 782-7433
Prerequisites:BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157.
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 discrete mathematics 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
- Growth of Functions
- Automata theory and Formal languages
There will be several graded assignments, one or more midterms, and a final exam. The details will be discussed in the first week of classes.
- Discrete and Combinatorial Mathematics (an Applied Introduction)
- Fifth Edition
- Ralph P. Grimaldi
- Discrete Mathematics and Its Applications
- K. H. Rosen
- McGraw Hill
- 7th or 8th Edition is acceptable
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
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS