Skip to main content (Press Enter)
Undergraduate Course

CISC 203 - Discrete Mathematics for Computing II

Description

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

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 a C- (obtained in any term) or a 'Pass' (obtained in Winter 2020) in (CISC 121 and [CISC 102 or MATH 110]).

External Links

Back to top