Academic Calendar 2023-2024

Search Results

CISC 203 Discrete Mathematics for Computing II

CISC 203  Discrete Mathematics for Computing II  Units: 3.00  

Proof methods. Combinatorics: permutations and combinations, discrete probability, recurrence relations. Graphs and trees. Boolean and abstract algebra.

Learning Hours: 120 (36 Lecture, 84 Private Study)  
Requirements: Prerequisite Level 2 or above and a minimum grade of a C- (obtained in any term) or a 'Pass' (obtained in Winter 2020) in (CISC 121 and [CISC 102 or MATH 110]).  
Offering Faculty: Faculty of Arts and Science