MATH 309 explains methods of discrete mathematics that are useful in computer science. The course covers set theory, propositional calculus, predicate calculus, relations, functions, Boolean algebra, divisibility, combinatorics, automata, and formal languages.
Epp, Susanna S. Discrete Mathematics with Applications: Custom Edition for Athabasca University. Toronto: Nelson Education, 2012.
Epp, Susanna S. Student Solutions Manual—Discrete Mathematics with Applications: Custom Edition for Athabasca University. Toronto: Nelson Education, 2012.
Course materials include a study guide, and a student manual. All other materials are available online.
To receive credit for the MATH 309 challenge registration, you must complete the two parts of the challenge exam and achieve a minimum grade of at least "D" (50 percent) on both parts.
Opened in Revision 7, June 18, 2013.