Queen's University Logo

Discrete Math for Computing II [CISC 203]

Discrete Math for Computing II

CISC-203

LEARNING HOURS: 120 (36L;84P)

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

PREREQUISITE: CISC 121/3.0 and (CISC 102/3.0 or MATH 110/6.0).

X