DISCRETE MATHEMATICS 1/3 Lec MT-RF- 9:00-9:50 WB229 Servatius, Herman
D01a Conference --W--- 11:00-11:50 FL311 Oleksandr Narykov onarykov
D01b Conference --W--- 11:00-11:50 SH202 Sadie Gauthier sggauthier
D02a Conference --W--- 1:00- 1:50 FL311 Hang Cai hcai
D02b Conference --W--- 1:00- 1:50 SH309 Marilda Bozdo mbozdo
D03a Conference --W--- 12:00-12:50 FL311 Hang Cai hcai
D03b Conference --W--- 12:00-12:50 SH308 Oleksandr Narykov onarykov
TA's: Donqing Xiao dxiao Hang Cai hcai Oleksandr Narykov onarykov PLA's: Marilda Bozdo mbozdo Sadie Gauthier sggauthier
This course provides an introduction to the mathematical structures of computer science.
Discrete mathematics includes topics on set theory, logic, proofs, relations, functions, orders of growth, induction, recursion, and graphs.
This course is recommended background for: CS2223, CS3133, CS3431, ECE3801 and most of upper-level mathematics.
There will be a quiz each Thursday.
The quizzes altogether count for 70% of your grade.
There will one final exam, worth 30% of your grade.
The policy for ALL make-up quizzes is to use the scaled final exam to replace the quiz.
Moreover, there is no penalty for not taking a quiz. You can decide after completing the quiz not to submit it. On the other hand, once submitted, it cannot be withdrawn, and the lowest quiz submitted is NOT dropped.
The final exam is not optional.