MA 2201 / CS 2022 - Discrete Mathematics

D Term 2019

Lecture:   MT-RF    9:00-9:50  WB229  Herman Servatius
Conference:
  20273 CS 2022 D01 --W--- 11:00-11:50 FL311
  20275 MA 2201 D01 --W--- 11:00-11:50 FL311

  20274 CS 2022 D02 --W---  1:00- 1:50 FL311
  20276 MA 2201 D02 --W---  1:00- 1:50 FL311

  21110 CS 2022 D03 --W--- 10:00-10:50 FL311
  21111 MA 2201 D03 --W--- 10:00-10:50 FL311  

Quiz Solutions

Final Exam

The final exam is on Tuesday, April 30th, the last day of class.

(If you schedule a flight for that time, you'll lose money one way or an other.)

Textbook:

The assigned problems for this class, together with a short lecture summary, will be posted periodically at the bottom of this page.

Text 1:

Text 2:

Instructor:

TA Office Hours:

TA: Guanyi Mou EMAIL: gmou
SA: Hung Hong  EMAIL: hphong
Office Hours:  Monday, Tuesday, Wednesday: 6pm A22 Fuller (Fuller Sub-basement) 

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.

Grading

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.

Homework: a couple of representative problems, will be collected each Monday. A satisfactory homework score may be used to decide boarder line cases in assigning final grades.

Other Helpful links