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