Mathematics (MATH) 309

Overview

Mathematics 309: Discrete Mathematics explains methods of discrete mathematics that are useful in computer science. The course covers number theory, set theory, logic, relations, functions, Boolean algebra, divisibility, combinatorics, regular expressions, and finite-state automata.

Outline

The course consists of the following six units:

• Unit 1: Speaking Mathematically
• Unit 2: Logic
• Unit 3: Numbers and Sequences
• Unit 4: Set Theory and Counting
• Unit 5: Functions and Relations
• Unit 6: Regular Expressions and Finite-State Automata

Learning outcomes

Upon successful completion of this course, you should be able to

• demonstrate a foundational understanding of discrete mathematics, with a focus on formal logic, set theory, counting, and automata.
• use discrete mathematical methods for applied problem solving in computer science, counting both combinations and permutations, identifying languages over alphabets, and creating finite-state automata to model specific processes.
• apply background knowledge to pursue further learning in related advanced mathematics and computer science courses.
• apply foundational skills in the development of mathematical proofs.
• communicate mathematical ideas and analyses in a clear and organized manner.

Evaluation

To receive credit for MATH 309, you must achieve a course composite grade of at least D (50 percent). You must also achieve midterm and final assessment grades of at least 50 percent.

The weighting of the composite grade is as follows:

To learn more about assignments and examinations, please refer to Athabasca University’s online Calendar.

Materials

Digital course materials

Links to the following course materials will be made available in the course:

Epp, S. S. (2020). Discrete mathematics with applications (5th ed.). Cengage.

Important links

• Academic advising
• Program planning
• Request assistance
• Support services