Description
Introduction to discrete mathematics and discrete structures. Topics include: propositional logic, predicate calculus, set theory, complexity of algorithms, mathematical reasoning and proof techniques, recurrences, induction, finite automata and graph theory. Material is illustrated through examples from computing.
Prerequisites
- Prerequisite(s): one Grade 12 university preparation mathematics course.
Conditions and arrangements
- Precludes additional credit for Precludes additional credit for MATH 1800 .
- Prerequisite(s): one Grade 12 university preparation mathematics course.
- Lectures three hours a week, tutorial one hour a week.
Reference text in its original language
Introduction to discrete mathematics and discrete structures. Topics include: propositional logic, predicate calculus, set theory, complexity of algorithms, mathematical reasoning and proof techniques, recurrences, induction, finite automata and graph theory. Material is illustrated through examples from computing.
- Prerequisite(s): one Grade 12 university preparation mathematics course.
- Precludes additional credit for Precludes additional credit for MATH 1800 .
- Lectures three hours a week, tutorial one hour a week.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/COMP/