D Term 2018

CS 2022 DISCRETE MATHEMATICS
Lecture MT-RF 9:00-9:50 WB229
   20352 CS 2022 D01 --W--- 11:00-11:50 FL311  Thomas LeBaron -- tlebaron
   20353 CS 2022 D02 --W---  1:00- 1:50 FL311  Skyler Kim     -- snkim
   24307 CS 2022 D03 --W--- 10:00-10:50 FL311  Jason Abel     -- jabel
   20354 MA 2201 D01 --W--- 11:00-11:50 FL311  Thomas LeBaron -- tlebaron
   20355 MA 2201 D02 --W---  1:00- 1:50 FL311  Jason Abel     -- jabel
   24308 MA 2201 D03 --W--- 10:00-10:50 FL311  Skyler Kim     -- snkim

Quiz Solutions

Final Exam

By popular vote (Up the Rebels!) final exam for this class is Monday, April 30th.

Text 1:

Text 2:

Instructor:

SA Office Hours:

THURSDAY
Fuller Sub-basement
   5-6pm Skyler Kim     -- snkim
   2-3pm Ming Xu        -- mxu2       
   4-5pm Jason Abel     -- jabel

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.

Homework (one representative problem) will be collected each tuesday.

There will be a quiz each Friday.

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.

Other Helpful links