一、先修課程 (Prerequisites)
<br>
<br>High-school mathematics, Calculus (preferred).
<br>
<br>
<br>二、課程說明 (Course Desc<x>ription)
<br>
<br>This course gives an introduction to the essentials of discrete and 
<br>combinatorial mathematics.
<br>
<br>
<br>三、指定用書 (Textbook)
<br>
<br>R. P. Grimaldi, <i>Discrete and Combinatorial Mathematics: An Applied 
<br>Introduction, 5th ed.</i> Boston: Pearson Addison Wesley, 2004.
<br>
<br>
<br>四、參考書籍 (References)
<br>
<br><ul>
<br><li>R. J. McEliece, R. B. Ash, and C. Ash, <i>Introduction to Discrete 
<br>Mathematics.</i> New York: Random House, 1989.
<br><li>N. L. Biggs, <i>Discrete Mathematics, 2nd ed.</i> New York: Oxford 
<br>University 
<br>Press, 2002.
<br><li>C. L. Liu, <i>Elements of Discrete Mathematics, 2nd ed.</i> New York: 
<br>McGraw-
<br>Hill, 1985.
<br><li>C. L. Liu, <i>Introduction to Combinatorial Mathematics.</i> New York: 
<br>McGraw-Hill, 1968.
<br><li>K. H. Rosen, <i>Discrete Mathematics and Its Applications, 8th ed.</i> New 
<br>York: McGraw-Hill, 2019.
<br><li>R. L. Graham, D. E. Knuth, and O. Patashnik, <i>Concrete Mathematics: A 
<br>Foundation for Computer Science, 2nd ed.</i> Reading, MA: Addison-Wesley, 1994.
<br></ul>
<br>
<br>五、課程內容 (Course Contents)
<br>
<br><ul>
<br> <li>Fundamentals: logic, set theory, mathematical induction, functions, 
<br>relations.
<br> <li>Enumeration: principles of counting, principle of inclusion and exclusion, 
<br>recurrence relations, generating functions.
<br> <li>Graph theory: introduction, trees, optimization and matching.
<br></ul>
<br>
<br>
<br>六、成績考核 (Grading)
<br>
<br>Homework 20%, two midterm exams 50%, final exam 30%.
<br>
<br>七、可連結之網頁位址 (Web Page)
<br>
<br>https://www.ee.nthu.edu.tw/ccc/eecs2060.html
<br>
<br>
<br>八、數位學習平台 (E-Learning)
<br>
<br>https://lms.nthu.edu.tw
<br>
<br>（加簽相關事宜說明請見七之課程網頁）
<br>
<br>
<br>