Fall 2011 (CS)
Instructor:
殷堂凱, Department
of Computer Science and Information Engineering
Office hours: Monday 1:00-4:00 P.M.
Office: 管院 623
Phone:
07-5919515
Email: tkyin@nuk.edu.tw
http://www.csie.nuk.edu.tw/~tkyin/
TA Office Hours: Friday 10:00-11:00 A.M., 法學院 410-1實驗室
Time:
Lectures: Monday 2-4
Location:
Lectures: 法學院 201
Objectives:
Introduce the topics and techniques of discrete methods and combinatorial reasoning
Lecture content:
1. Fundamentals of discrete mathematics
2. Topics in enumeration
Lecture syllabus:
|
Lecture |
Date |
Subject |
Note |
|
1 |
9/12 |
Vacation, no class. |
|
|
2 |
9/19 |
Fundamental principles of counting |
|
|
3 |
9/26 |
Fundamentals of logic |
|
|
4 |
10/3 |
Fundamentals of logic |
Quiz 1 |
|
5 |
10/10 |
Vacation, no class. |
|
|
6 |
10/17 |
Properties of the integers: mathematical induction |
|
|
7 |
10/24 |
Relations and functions |
Quiz 2 |
|
8 |
10/31 |
Relations and functions |
|
|
9 |
11/7 |
Midterm exam |
|
|
10 |
11/14 |
Relations: the second time around |
|
|
11 |
11/21 |
Relations: the second time around |
|
|
12 |
11/28 |
Relations: the second time around |
|
|
13 |
12/5 |
The principle of inclusion and exclusion |
Quiz 3 |
|
14 |
12/12 |
The principle of inclusion and exclusion |
|
|
15 |
12/19 |
Generating functions |
|
|
16 |
12/26 |
Generating functions |
Quiz 4 |
|
17 |
1/2 |
Generating functions |
|
|
18 |
1/9 |
Final exam |
|
Grade:
Textbook:
Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition, by Ralph P. Grimaldi, Pearson, 2004. 新月代理