離散數學
Discrete Mathematics
| 節 | 週一 | 週四 |
|---|---|---|
3 10:10–11:00 | 離散數學 SA320（光復） 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 離散數學 SA320（光復） |
* 根據陽明交大上課時間表所列
Discrete Mathematics serves as the mathematical foundation of Computer Science and is the counterpart of Calculus. Systematic technique of counting, enumerating, arranging and identification of subsets of a finite set and basic theory of Theoretical Computer Sciences will be introduced in this course.
Calculus I, Linear Algebra I, Introduction to Computer Science (I)
無備註
Use ppt and e3 system.
appearance and and homeworks (including programings) 30% midterm 30% final 40%
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | 1. Permutations, Combinations, and Combinatorial Reasoning 2026-02-23(一),2026-02-26(四) |
| 第 2 週 | 1. Permutations, Combinations, and Combinatorial Reasoning 2026-03-02(一),2026-03-05(四) |
| 第 3 週 | 2. The Pigeonhole Principle and Inclusion-Exclusion Principle 2026-03-09(一),2026-03-12(四) |
| 第 4 週 | 2. The Pigeonhole Principle and Inclusion-Exclusion Principle 2026-03-16(一),2026-03-19(四) |
| 第 5 週 | 3. Generating Functions 2026-03-23(一),2026-03-26(四) |
| 第 6 週 | 4. Recurrence Relations and Special Counting Sequences 2026-03-30(一),2026-04-02(四) |
| 第 7 週 | 4. Recurrence Relations and Special Counting Sequences 2026-04-06(一),2026-04-09(四) |
| 第 8 週 | Midterm 2026-04-13(一),2026-04-16(四) |
| 第 9 週 | 5. Asymptotics 2026-04-20(一),2026-04-23(四) |
| 第 10 週 | 5. Asymptotics 2026-04-27(一),2026-04-30(四) |
| 第 11 週 | 6. Trees, Prüfer codes, and Kruskal’s Algotithm 2026-05-04(一),2026-05-07(四) |
| 第 12 週 | 6. Trees, Prüfer codes, and Kruskal’s Algotithm 2026-05-11(一),2026-05-14(四) |
| 第 13 週 | 7. Language, Grammar, Automata and Turing Machines 2026-05-18(一),2026-05-21(四) |
| 第 14 週 | 7. Language, Grammar, Automata and Turing Machines 2026-05-25(一),2026-05-28(四) |
| 第 15 週 | 7. Language, Grammar, Automata and Turing Machines 2026-06-01(一),2026-06-04(四) |
| 第 16 週 | Final 2026-06-08(一),2026-06-11(四) |
Lecture Notes will be provided. The following book is for the purpose of English reading ability training only: 1. Mathematical Thinking, Problem-Solving and Proofs by John P. D'Angelo and Douglas B. West (Chapters 4, 9, 10, 11, 12) 2. Discrete Mathematics with Applications by Susanna S. Epp (Chapters 11, 12) 3. Introductory Combinatorics by Richard A. Brualdi
- 地點
- SA 350
- 時間
- Monday, 16:20-17:30. Send an e-mail to me to make appointment or any time when you find me in my office.
- 聯絡方式
- weng@math.nctu.edu.tw (03)5731610