Discrete Mathematics

Instructor:

殷堂凱, Department of Computer Science and Information Engineering
Office hours: Thursday 1:00-2:30 P.M.
Office: 理工二 305
Phone: 07-5919515
Email: tkyin@nuk.edu.tw

TA Office Hours: Friday 1:00-3:00 P.M., 系辦公室

Time:

Lectures: Tuesday 2-4

Location:

Lectures: 理工第一實驗大樓 415

Objectives:

Introduce the topics and techniques of discrete methods and combinatorial reasoning

Lecture content:

1. Fundamentals of discrete mathematics

2. Topics in enumeration

3. Graph theory and applications

Lecture syllabus:  

　

Lecture	Date	Subject	Note
1	9/19	Fundamental principles of counting
2	9/26	Fundamentals of logic, set theory
3	10/3	Properties of the integers: mathematical induction	Quiz 1
4	10/10	no class
5	10/17	Relations and functions
6	10/24	Relations and functions
7	10/31	Relations: the second time around	Quiz 2
8	11/7	Relations: the second time around
9	11/14	Midterm exam
10	11/21	The principle of inclusion and exclusion
11	11/28	The principle of inclusion and exclusion
12	12/5	Generating functions	Quiz 3
13	12/12	Generating functions
14	12/19	Recurrence relations
15	12/26	Recurrence relations	Quiz 4
16	1/2	An introduction to graph theory
17	1/9	An introduction to graph theory
18	1/16	Final exam

Grade:

• Midterm (30%)
• Final (30%)
• 4 Quizzes (40%)
• Class attendance (-10% ~ +10%)

Textbook:

Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition, by Ralph P. Grimaldi, Pearson, 2004. 新月代理