Discrete Mathematics

(4190.101 002 강좌)

1. overview

- obtain basic knowledge of discrete mathematics

- learn how to apply discrete mathematics to computer science

2. textbook

Discrete mathematics and its applications

Kenneth Rosen

McGraw-Hill, 5th ed.

3. schedule

Nov. 2^nd: no class

Nov. 4^th: the 2nd exam

1^st week: introduction, logic (intro, 1-logic1, 1-logic2)

2^nd week: proof, set theory (2-proof, 3-set)

3^rd week: functions, algorithms (4-functions, 5-algorithms)

4^th week: order of growth, complexity (6-order-growth, 7-complexity)

5^th week: number theory, matrices (8-numbers, 9-matrices)

6^th week: proof strategy, sequences (11-sequences)

7^th week: summations, inductive proofs (12-summation, 13-induction)

8^th week: recursion, combinatorics (14-recursion, 15-combinatorics)

9^th week: probability (16-prob)

11^th week: graph theory (19-graphs-1, 19-graphs-2)

12^th week: reserved for delay

4. grading

three exams 3*30% (by TA)

attendance 10%

5. TA

Chang, Duk-hyun

880-1832

7. 첫 번째 시험 답안지 : mid-sol

두 번째 시험 답안지 : mid2-sol

세 번째 시험 답안지 : final-sol