Professor : Kwangjo Kim (x.6118)

TA  : Joonsang Baek(x.6158), Bo-yeon Song (x.6168)

Credit : 3

1. Description

 

This course introduces the basic mathematical tools to characterize the hard problems occurring in all the fields of computer science and other areas and reviews how to utilize them  in real applications. After this course, every student can  study  more advanced  graduate courses in his/her major area, and express his/her own problems in a mathematical terminology to solve efficiently.  The typical topics covered in this course are as follows  :   Logics, Sets and Functions  Mathematical Reasining  Counting, Relation, Graphs  Boolean Algebra, Finite-State Machines, Compatibilty. etc

1) Main Text:
• Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGRAW-HILL, 4th Edition, 1999

2) Sub Text:
• Applied Combinatoric,  Fred S. Roberts, Prentice Hall, 1984. and Handouts

         1) Test 75% (Mid  30%, Final 40%, Quiz 5%)
         2) Self Study 20% (H/W 15%, TP 5%)
         3) etc(attendancy): 5%

4. Weekly Lecture Plan

 

Week	Contents	Remark
I (1~4)	- The Foundations:Logic, Sets, and      Functions(1) - The Foundations:Logic, Sets, and      Functions(2) - The Fundamentals: Algorithms, the      Integers, and Matrices(1) - The Fundamentals: Algorithms, the      Integers, and Matrices(2)	HW #1 TP#1 Quiz #1
Ⅱ (5~8)	- Mathmematical Reasening - Combinatorics(1) - Combinatorics(2) - Mid-term Exam.	HW #2
Ⅲ (9~12)	- Relations - Graphs and Trees(1) - Graphs and Trees(1) - Boolean Algebra	H/W #3 Quiz #2
Ⅳ (13~15)	- Modeling Computation(1) - Modeling Computation(2) - Final Exam.	TP#2

(Note : Authorization required for access this page.)