Sign-in Links
CISC 203 Discrete Structures II Units: 3.00
Advanced proof methods for discrete structures from an object-oriented perspective. Combinatorics: advanced counting methods. Solving and applying recurrence relations. Graph theory including graph algorithms, structural induction, and proofs.
Learning Hours: 120 (36 Lecture, 84 Private Study)
Requirements: Prerequisite Level 2 or above and a minimum grade of C- in both CISC 102/3.0 and CISC 121/3.0.
Offering Faculty: Faculty of Arts and Science
Course Learning Outcomes:
- Construct mathematical proofs using structural induction.
- Analyze code, functions, or real-world applications to find and solve for recurrence relations.
- Apply known algorithms to graphs or trees that arise in applications to develop correct code.
- Apply object-oriented paradigms to solve problems using discrete structures.