Fall 2007 (CS)
Instructor:
殷堂凱, Department
of Computer Science and Information Engineering
Office hours: Thursday 1:00-2:30 P.M.
Office: 管院 623
Phone:
07-5919515
Email: tkyin@nuk.edu.tw
TA Office Hours: Friday 1:00-3:00 P.M., 法學院 410-1實驗室
Time:
Lectures: Tuesday 2-4
Location:
Lectures: 法學院 106
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/18 |
Fundamental principles of counting |
|
|
2 |
9/25 |
Holiday, no class |
|
|
3 |
10/2 |
Fundamentals of logic |
|
|
4 |
10/9 |
Properties of the integers: mathematical induction |
Quiz 1 |
|
5 |
10/16 |
Relations and functions |
|
|
6 |
10/23 |
Relations and functions |
|
|
7 |
10/30 |
Relations: the second time around |
Quiz 2 |
|
8 |
11/6 |
Relations: the second time around |
|
|
9 |
11/13 |
Midterm exam |
|
|
10 |
11/20 |
The principle of inclusion and exclusion |
|
|
11 |
11/27 |
Generating functions |
|
|
12 |
12/4 |
Generating functions |
Quiz 3 |
|
13 |
12/11 |
Recurrence relations |
|
|
14 |
12/18 |
Recurrence relations |
|
|
15 |
12/25 |
An introduction to graph theory |
Quiz 4 |
|
16 |
1/1 |
Holiday, no class |
|
|
17 |
1/8 |
An introduction to graph theory |
|
|
18 |
1/15 |
Final exam |
|
Grade:
Textbook:
Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition, by Ralph P. Grimaldi, Pearson, 2004. 新月代理