Description
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.
Follow-On Courses
This course appears in the pre- or co-requisites for the following course(s):
Learning Hours
120 (36 Lecture, 84 Private Study)
Prerequisite
Level 2 or above and a minimum grade of C- in both CISC 102/3.0 and CISC 121/3.0.