CSI 1013 Discrete Mathematics

This course offers an intensive introduction to discrete mathematics as it is used in computer science. Topics include functions relations sets propositional and predicate logic simple circuit logic proof techniques elementary combinatorics and discrete probability. Three hours of lecture. Prerequisite: MTH 0907 Intermediate algebra (or equivalent) with a grade of C or better.

Credits

3

Prerequisite

1GROUP MTH 0907 MINIMUMGRADEC MTH 0004 FROMRULEACCU.2YR MTH 0009 FROMRULEACT.2YR MTH 0005 FROMRULEACCU.2YR MTH 0006 FROMRULEACCU.2YR MTH 0007 FROMRULEACCU.2YR MTH 0008 FROMRULEACCU.2YR MTH 0010 FROMRULEACT.2YR MTH 1000 MTH 1008 MTH 1009 MTH 1010 MTH 1011 MTH 1003 MTH 1004 MTH 1005 MTH 1006 MTH 1007 MTH 2001 MTH 2002 ECN 2004 MTH 0012 FROMRULESAT.2YR MTH 0013 FROMRULESAT.2YR MTH 0920