The goal of the course is to understand mathematical reasoning that is used for computer science. This will include logic, set theory, combinatorics, number theory, probability theory, and graph theory. It also aimed at introducing algorithmic approach for solving any well-posed problems that you may encounter everyday.

이산구조 탐구에 필요한 수학적 지식을 개괄적으로 학습한다. 집합론, 그래프론, 조합론의 기초개념을 학습하고 알고리즘, 네트워크, 부울대수, 오토마타 등에의 응용을 다룬다.

None. However, I recommend you to understand calculus not because you need calculus for this course, but the mathematical capabilities required for reasoning, reading and writing.

없음(helpful but not necessary)
(C, FORTRAN, BASIC 등 프로그래밍 언어를 알면 도움이 되지만 몰라도 문제없음)

HW and Quiz : 20%
Midterm : 40%
Final : 40%

You should expect a quiz in every recitation session, but the questions will be more or less the same questions you have experience from the homework exercise set of the week before. One more thing to add - although it is painful to say so, but due to the regulations I have to give F for those who missed more than seven classes.

----------------------------------------------
숙제 및 퀴즈(HW and Quiz): 20%,(숙제제출여부는개강후필요여부검토하여결정)
중간고사(Mid-term): 40%,
기말고사(Final): 40%
----------------------------------------------
1.매주 진도 후에 주로 교과서 문제 중 숙제문제 번호를 공지할 것입니다.(제출문제는 별도표시)
(연습시간의 퀴즈는 지난 주 숙제 문제 중에서 2~3문제 선별하여 대동소이하게 나옴.)

출석 : (이전 학기들의 이산수학 출석 규정을 대동소이하게 적용함)
((학칙 및 관계법령에 의하여 1/4 이상 결석시 F학점))

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th Edition
Eric Lehman, F Thomson Leighton, Albert Meyer, Mathematics for Computer Science (This book is free - you can google it then click download)

Week 01: Chapter 1 Sets and Logic
Week 02: Chapter 3 Functions, Sequences, and Relations
Week 03: Chapter 4 Algorithms
Week 04: Chapter 5 Introduction to Number Theory
Week 05: Chapter 6 Counting methods
Week 06: Chapter 6 Counting methods (continued)
Week 07: Chapter 7 Recurrence relations
Week 08: Midterm
Week 09: Chapter 8 Graph theory,
Week 10: Chapter 8 Graph theory (continued)
Week 11: Chapter 8 Graph theory (continued), 9 Trees
Week 12: Chapter 9 Trees(continued),
Week 13: Chapter 10 Network models,
Week 14: Chapter 11 Boolean algebra and combinatorial circuits
Week 15: Chapter 12 Automata
Week 16: Final