**(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

2^{nd} week: proof, set theory

3^{rd} week: functions, algorithms

4^{th} week: order of growth, complexity

5^{th} week: number theory, matrices

6^{th} week: proof strategy, sequences

7^{th} week: summations, inductive proofs

8^{th} week: recursion, combinatorics

9^{th} week: probability

10^{th} week: recurrences, relations

11^{th} week: graph theory

12^{th} week: reserved for delay

4. grading

three exams 3*30% (by TA)

attendance 10%

5. TA

Chang, Duk-hyun

880-1832

6. Board

**7**. Ã¹ ¹øÂ° ½ÃÇè ´ä¾ÈÁö : mid-sol

¼¼ ¹øÂ° ½ÃÇè ´ä¾ÈÁö : final-sol