|
 |
TextBook: |
Rosen, "Discrete Mathematics and its
Applications", 5th ed., McGraw Hill.
 |
Course
Schedule: |
Week
No. |
Section
No.
|
Lectures
|
Homework*2
|
1 |
Preface,
1.1~1.3 |
The
Foundations: Logic and Predicates
|
§1.1: 30, 48, 51-55
§1.2: 24,
38, 40
§1.3: 14, 30, 40,
52
|
2
|
1.4
(二二八放假)
|
The
Foundations: Proof and Functions |
§1.4: 16,
28(d,f,g,j), 48
|
3
|
1.5, 3.1, 1.8, 3.2.1, |
The
Foundations: Proof and Functions
|
§1.5: 2, 10(b,d), 16,
22,58
§3.1: 16, 24, 32
§1.8: 6(b,d,e), 18,
26, 44
Due:
13/03/2006 09:00AM
|
4
|
3.2.2,
3.3, 2.1 |
Mathematical
Reasoning and Induction |
§3.2: 6,10,16,32,40
§3.3:
6,18,22,44,52
|
5
|
2.2, |
MiniQuiz_1:
(§1.1~§1.5,§1.8,
§3.1, §3.2),
The
Funcdamentals: Algorithms and Complexity |
§2.1: 2, 26, 46 §2.2: 2, 24(b,e), 28,
34, 44
|
6
|
2.3 |
MiniQuiz_2:§3.3,§2.1,§2.2 The
Funcdamentals: Complexity and Integers |
§2.3: 16, 28
|
7
|
期中考I(4/April) |
8
|
2.4,
|
The
Integers and Division
|
§2.4:20,46,56 |
9
|
2.5,2.6 |
Integers
and Algorithms
|
§2.5:20,22, 54 §2.6:20,23,28 |
10
|
4.1~4.3, |
MiniQuiz_3:
April/24
13:00-14:30
Counting:
Permutation and Combinations,
Number
Theory and Applications
|
§4.1: 35, 39, 47 §4.3: 27, 31 |
11
|
4.4,
4.5, |
MiniQuiz_4:
May/01
13:00-14:30
 |
pp.115:
6,7,11,12,13,24,25 |
 |
pp.131: 41,47 |
 |
pp.143: 22,23,24 |
 |
pp.181: 19 |
 |
pp.194:
7,8,11,12 |
Binomial Coefficients
Generalized Permutation and Combinations
|
§4.4: 22(b), 33, 34 §4.5: 35,45 |
12
|
3.4,3.5, |
MiniQuiz_5:
 |
§4.1~§4.5 |
 |
pp.115: 10, 15, 19, 23,
47 |
 |
pp.131: 50, 53 |
 |
pp.142: 19, 25 |
 |
pp.181: 54 |
 |
pp.194: 14, 21 |
Recursive
Definition and structural induction
Recursive
Algorithm
|
§3.4: 5, 13, 25, 34,
35, 36, 38, 39, 40, 60, 61 §3.5: 16, 22, 30, 32, 34,
38, 41, 42 |
13
|
6.1-
, |
MiniQuiz_6:
 |
§3.4~§3.5 |
 |
pp.52:
13 |
 |
pp.74:
11 |
 |
pp.195:
20, 21 |
 |
pp.333:
9, 11 |
 |
pp.342:
16, 46 |
§6.1: Recurrence
relations
|
§6.1: 23, 25, 27, 29,30, 40, 46 |
14
|
6.2-
6.3,
|
MiniQuiz_7:
 |
pp.271:
18, 26, 27, 49, 50, 54, 55 |
 |
pp.284:11,
21, 29, 32, 38, 40 |
 |
pp.410:
23, 25, 27, 29, 30, 60, 46 |
§6.2:Advanced
Counting: Solving Recurrence Relations,
§6.3:Divide and Conquer Algorithms
|
§6.2: 4(d,e,f,g), 26,
27, 29, 31, 45, 46 §6.3: 6, 12, 20,21, 25 |
15 |
7.1~7.3,
|
MiniQuiz_8:
 |
pp.284:11,
21, 29, 32, 38, 40 |
 |
pp.410:
23, 25, 27, 29, 30, 60, 46 |
 |
§6.2, §6.3
|
Ch 7:Relations:
Properties, n-ary relations, representation
|
§7.1: 17, 19, 31-35,
39,41,42 §7.3: 8, 14, 15, 31, 32 |
16 |
7.4,
7.5,
8.1~ 8.2,
|
MiniQuiz_9:
 |
pp.284:33,
38 |
 |
pp.410:
17, 30 |
 |
pp.424: 25, 27,
31 |
 |
pp.434:12,
22 |
 |
pp.466:
9 |
Ch 7: Relations:
Equivalence relations and Closure of Relations
Ch 8: Graphs:
Introduction and Terminology,
|
§7.4: 10, 26 §7.5: 18, 30, 32, 36 §8.2: 19-25, 41, 42,
|
17
|
8.2~
8.5, |
MiniQuiz_10:
 |
pp.284:
38 |
 |
pp.410:
23-25 |
 |
pp.425:
45,46 |
 |
pp.434:
21, 22 |
 |
pp.481:
32-35, 38, 39 |
 |
pp.434:12,
22 |
 |
pp.495:
14 |
 |
§7.4: 10, 26 §7.5: 18, 30, 32, 36 §8.2: 19-25, 41, 42, |
Graphs: Introduction and Terminology, Isomorphism,
Connectivity, Euler Paths,
Graphs: Shortest path, Planar & Coloring
|
|
18
|
Final Examination (40%) :
Solution
 |
pp.115:
6,7,11,12,13,24,25 |
 |
pp.208:
4, 17, 20 |
 |
pp.291:11,16 |
 |
pp.292:10,11 |
 |
pp.352:35,37 |
 |
pp.467:
11 |
 |
pp.545:
27 |
 |
pp.563:1-4,
13-15, 34-44,61-64 |
 |
pp.575:12,13,21,23-26 |
 |
pp.588:1-8,13-15,18-23,30-40 |
 |
pp.601:
4, 26 |
|
Note:
Every
mini-quiz covers the homework you have written since last examination. They will
be held on Monday.
 |
TA: |
劉筱薇 93325117@stmail.tcu.edu.tw
分機.: 5008
 |
Grading |
Mini-quiz 10% X 12
|
|