MAT 1348 Discrete Mathematics for Computing
3 units
Mathematics
Faculty of Science
Introduction to discrete structures as a foundation to computing. Propositional logic. Fundamental structures: functions, relations, sets. The basics of counting: counting arguments, the pigeonhole principle, permutations and combinations. Introduction to proofs: direct, by contradiction, by cases, induction. Topics in graph theory: isomorphism, cycles, trees, directed graphs. Whenever possible applications from computing and information technology will be included.
Components:
Discussion Group
Lecture
Requirements:
Previously Offered Terms:
Winter
Summer
French Equivalent:
Organized
1109 responses
4.52
/ 5
Clear Expectations
645 responses
4.55
/ 5
Learned a Lot
1106 responses
4.43
/ 5
Recommend
465 responses
4.12
/ 5
Workload
465 responses
2.78
/ 5
Fair Assessments
1108 responses