| 當期課號 | 2732 | Course Number | 2732 |
|---|---|---|---|
| 授課教師 | 吳世弘 | Instructor | WU,SHIH HUNG |
| 中文課名 | 離散數學 | Course Name | Discrete Mathematics |
| 開課單位 | 資訊工程系(四日)三B | Department | |
| 修習別 | 必修 | Required/Elective | Required |
| 學分數 | 3 | Credits | 3 |
| 課程目標 | "離散數學是所有數位資訊處理的基礎. 學生在修習完此課程後, 將可瞭解以下知識: (1)讓學生更精明; (2)解決某些有趣的問題; (3)提昇學生的邏輯及思考能力. 學生在修習完此課程後, 將可瞭解以下主題: 計數的基本原則, 邏輯的基礎, 集合理論, 數學歸納法, 關係與函數, 有限狀態機語言, 包含與排除的原則, 生成函數, 遞迴關係, 圖形理論的介紹, 樹, 與最佳化和配對. " | Objectives | Discrete Mathematics is the basis of all of “digital” information processing. After completing this course, students will realize the following: (1) Make students smarter; (2) Solve interesting problem; (3) Promote the logic and thinking capabilities of the students. After completing this course, students will realize the following topics: Fundamental Principles of Counting, Fundamentals of Logic, Set Theory, Mathematical Induction, Relations and Functions, Languages: Finite State Machines, The Principle of Inclusion and Exclusion, Generating Functions, Recurrence Relations, An Introduction to Graph Theory, Trees, and Optimization and Matching. |
| 教材 | 課本： R.P. Grimaldi, “Discrete and Combinatorial Mathematics”, 5th edition, Addison Wesley, 2004. (東華代理) |
Teaching Materials | 課本： R.P. Grimaldi, “Discrete and Combinatorial Mathematics”, 5th edition, Addison Wesley, 2004. (東華代理) |
| 成績評量方式 | 1. 隨堂考n次(Course Exam): 20% 2. 小考n次(Quizzes): 20% 3. 期中考(Midterm Exam): 30% 4. 期末考(Final Exam): 40% 5. 課程參與(Participation): 5% |
Grading | 1. Course Exams: 20% 2. Quizzes: 20% 3. Midterm exams: 30% 4. Final Exam: 40% 5. Course Participation: 5% |
| 教師網頁 | http://www.csie.cyut.edu.tw/~shwu | ||
| 教學內容 | 離散數學課程的主題: 計數的基本原則, 邏輯的基礎, 集合理論, 數學歸納法, 關係與函數, 有限狀態機語言, 包含與排除的原則, 生成函數, 遞迴關係, 圖形理論的介紹, 樹, 與最佳化和配對. | Syllabus | Discrete Mathematics includes the following topics: Fundamental Principles of Counting, Fundamentals of Logic, Set Theory, Mathematical Induction, Relations and Functions, Languages: Finite State Machines, The Principle of Inclusion and Exclusion, Generating Functions, Recurrence Relations, An Introduction to Graph Theory, Trees, and Optimization and Matching. |