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:
All Professors
B Average (6.185)
Most Common: A+ (15%)
1537 students
F
D
C
B
A-
A+
Unknown Professor
Winter 2022 - A00
B Average (6.182)
Most Common: A- (16%)
159 students
F
D
C
B
A-
A+