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. Also listed as MATH 1805. Prerequisite(s): one Grade 12 university preparation mathematics course.Lectures three hours a week, tutorial one hour a week.

COMP 1805 [0.5 credit] Discrete Structures I

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. Also listed as MATH 1805. Prerequisite(s): one Grade 12 university preparation mathematics course.Lectures three hours a week, tutorial one hour a week.





There are no comments for this course.