CSI 2101 Discrete Structures
3 units
Computer Science
Faculty of Engineering
Discrete structures as they apply to computer science, algorithm analysis and design. Predicate logic. Review of proof techniques; application of induction to computing problems. Graph theory applications in information technology. Program correctness, preconditions, postconditions and invariants. Analysis of recursive programs using recurrence relations. Properties of integers and basic cryptographical applications.
Components:
Lecture
Tutorial
Requirements:
Prerequisite: MAT 1348 .
Previously Offered Terms:
Winter
Summer
French Equivalent:
Organized
512 responses
4.04
/ 5
Clear Expectations
356 responses
4.06
/ 5
Learned a Lot
512 responses
3.80
/ 5
Recommend
157 responses
3.39
/ 5
Workload
157 responses
2.57
/ 5
Fair Assessments
510 responses