離散數學

臺北科技大學 115-1 學期課程，課號 364955。

課程大綱

1.邏輯與證明 2.集合,關聯式與函數 3.遞迴與演算法 4.計數與機率（排列,組合） 5.遞迴式 6.圖與樹（基礎圖論） Objectives: This course covers the part of mathematics devoted to discrete events, i.e., events that involve distinct or unconnected elements, finite structures of distinct elements. These topics are very useful in the study of computer science --- especially in the areas of data structure, the analysis of algorithms, and the theory of computer languages.

課程進度

1. Introduction 2. Sets 3. No Class (中秋假) 4. Relations and Functions 5. No Class (國慶日) 6. Logic 7. Proof 8. Mid-term Exam 9. Recursion, and Analysis of Algorithms 10. Recurrence Relations 11. Counting (Permutation) and Counting (Combination) 12. Probability 13. Graphs Theory 14. Trees and Trees Application 15. Final Exam 16. Term Project

評量方式

Grading: 20% Attendance and Quizzes 20% Term Project and Flexible Learning 30% Mid-term Exam 30% Final Exam

教材

【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】 使用外文原文書：是 Textbook: Discrete Mathematics, Seventh Edition, Richard Johnsonbaugh, Prentice Hall, 2009. (華泰); 離散數學(七版)，吳世弘 譯 (華泰) Reference Book: How to Prove It: A Structured Approach, 2nd Edition, Daniel J. Velleman, Cambridge University Press.