Overview
Introduction to mathematical discourse and proof methods. Sets, functions, sequences, and relations. Properties of the integers. Induction. Equivalence relations. Linear and partial orderings.
Learning Outcomes
Upon successful completion of this course students will be able to:
- Apply standard Mathematics notation used in the field of Computing.
- Recognize the difference between a proof and a counter example.
- Able to formulate elementary proofs using mathematical induction.
- Recognize comparative magnitudes of functions such as log(n), n2, 2n.
- Ability to read and understand some elementary logical proofs.
Topics
- Sets theory
- Logic
- Relations
- Functions
- Induction
- Properties of Integers
- Primes
- GCD
- LCD
- Modular Arithmetic
- Equivalence Relations
- Binomial Coefficients
- Advanced counting
- Recurrences
- Methods of proof
Terms
Evaluation
Weight Assessment
12% Concept Check-In (x6)
48% Homework (x6)
10% Group Work
30% Final Exam
*You must pass the final exam with a minimum grade of 60% in order to pass this course.*
**The evaluation breakdown is subject to change.**
Live Sessions
This course has optional live sessions (e.g. webinars, synchronous activities).
Textbook and Materials
ASO reserves the right to make changes to the required material list as received by the instructor before the course starts. Please refer to the Campus Bookstore website at http://www.campusbookstore.com/Textbooks/Search-Engine to obtain the most up-to-date list of required materials for this course before purchasing them.
- Sarah-marie Belcastro, Discrete Mathematics with Ducks, A K Peters/CRC Press.
- Marc Lipson Seymour Lipschutz, Schaum's outline of Discrete Mathematics, McGraw-Hill
Note: The required materials are available to purchase as e-textbooks from the publishers/Amazon.
Time Commitment
Students can expect to spend approximately 18-20 hours a week (120 hours per term) in study/practice and online activity for CISC 102.