Math 1302 Discrete Mathematics

MATH 1302: Discrete Mathematics

Course Description:

This course is primarily intended for students majoring in Computer Science. The emphasis will be on the development of technical discrete mathematics skills, rather than rigorous proof. Topics will include sets, logic, induction, elementary counting techniques, functions, graph theory, and number theory.

Required Textbook and Materials:

The main required textbooks for this course are listed below and can be readily accessed using the provided links. There may be additional required/recommended readings, supplemental materials, or other resources and websites necessary for lessons; these will be provided for you in the course’s General Information and Forums area, and throughout the term via the weekly course Unit areas and the Learning Guides.

Software Requirements/Installation:

There are no special requirements that exceed general internet access.

Learning Objectives and Outcomes:

By the end of this course students will be able to:

1. Identify and define the basic structures of discrete mathematics including sets, combinatorics, logic, graphs, number theory, and functions.
2. Use methods from logics, combinatorics, and graph theory to perform calculations and solve problems involving discrete structures.
3. Apply logical thinking to write simple proofs of arithmetical statements.
4. Apply the tools and methods of discrete mathematics to real-world problems in computer science, especially in the analysis of recursive algorithms and number theory.

Course Schedule and Topics:

This course will cover the following topics in eight learning sessions, with one Unit per week.

Week 1: Unit 1 – Basic Mathematical Notation and Set Theory

Week 2: Unit 2 – Combinatorics

Week 3: Unit 3 – Logic

Week 4: Unit 4 – Sequence and Series

Week 5: Unit 5 – Recursion

Week 6: Unit 6 – Functions

Week 7: Unit 7 – Graph and Graph Theory

Week 8: Unit 8 – Number Theory

Week 9: Unit 9 – Course Review and Final Exam