---

Discrete Mathematics

(4190.101 002 강좌)

---

* 공지 : 게시판을 만들었습니다.

* 휴강 : Sept. 16-due to Thanksgiving.

* 휴강 : Sept. 23-due to excursion.

* 휴강 : Sept. 26-due to workshop with French researchers.

* 휴강 : Oct. 12-due to ITRC proposal presentation.

* 강의 중간 평가 : Oct. 11 ~ Oct. 21(Check the Board!!)

* 공지 : 중간고사 일정이 10/31로 변경되었습니다.(게시판을 확인하세요!!)

* 휴강 : Oct. 28-due to freshman candidate interview.

* 공지 : Exercise #1 문제가 게시되었습니다.(Link)

* 공지 : Exercise #2 문제가 게시되었습니다.(Link)

* 공지 : Exercise #3 문제가 게시되었습니다.(Link)

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.

ISBN 0-07-119881-4

3. lecturenote

(Introduction)

1. Logic (§§1.1-1.4)( 1-logic1) (1-logic2)
2. Proof methods (§1.5)(2-proof)
3. Set theory (§§1.6-1.7)(3-set)
4. Functions (§1.8)(4-function)
5. Algorithms (§2.1)(5-algorithm)
6. Orders of Growth (§2.2)(6-order-growth)
7. Complexity (§2.3)(7-complexity)
8. Number Theory (§2.4-2.6)(8-numbers)
9. Matrices (§2.7)(9-matrices)

10. Proof strategy (§3.1)
11. Sequences (§3.2)(11-sequences)
12. Summations (§3.2)(12-summations)
13. Inductive proofs (§3.3)(13-induction)
14. Recursion (§3.4-3.5)(14-recursion)
15. Combinatorics (ch. 4)(15-combinatorics)
16. Probability (ch. 5)(16-prob)
17. Recurrences (§6.1-6.3)(17-recurrence)

18. Relations (ch. 7)(18-relations1)(18-relations2)
19. Graph Theory (chs. 8+9)(19-graphs1)(19graphs2)

4. grading

Two exams : 2 * 40%

Attendance : 20%

5. TA

Lee, Youn Do

Tel : 880-1832

Office : 301-518

ydlee@mmlab.snu.ac.kr

6. Board