一、先修課程 (Prerequisites)
<br>
<br>High-school mathematics.
<br>
<br>
<br>二、課程說明 (Course Description)
<br>
<br>This course gives an introduction to the essentials of discrete mathematics.
<br>
<br>
<br>三、指定用書 (Textbook)
<br>
<br>N. L. Biggs, <i>Discrete Mathematics, 2nd ed.</i> Oxford University Press, 2002.
<br>
<br>
<br>四、參考書籍 (References)
<br>
<br><ol>
<br><li>R. J. McEliece, R. B. Ash, and C. Ash, <i>Introduction to Discrete Mathematics.</i> Random House, 1989.
<br><li>C. L. Liu, <i>Elements of Discrete Mathematics, 2nd ed.</i> McGraw-Hill, 1985.
<br><li>C. L. Liu, <i>Introduction to Combinatorial Mathematics.</i> McGraw-Hill, 1968.
<br><li>K. H. Rosen, <i>Discrete Mathematics and Its Applications, 5th ed.</i> McGraw-Hill, 2003.
<br><li>R. P. Grimaldi, <i>Discrete and Combinatorial Mathematics, 5th ed.</i> Addison Wesley, 2004.
<br><li>R. Johnsonbaugh, <i>Discrete Mathematics, 6th ed.</i> Prentice Hall, 2005.
<br><li>R. L. Graham, D. E. Knuth, and O. Patashnik, <i>Concrete Mathematics: A Foundation for Computer Science, 2nd ed.</i> Addison-Wesley, 1994.
<br></ol>
<br>
<br>
<br>五、課程內容 (Course Contents)
<br>
<br><ul>
<br><li>Fundamentals: sets; principle of induction; Euclid's algorithm; functions; equivalence relations; partial orderings; infinite sets.
<br><li>Enumeration: principles of counting; sieve principle; linear recursions; generating functions.
<br><li>Algorithms and graphs: efficiency of algorithms; graphs; trees, sorting, and searching; bipartite graphs and matching problems; digraphs, networks, and flows; dynamic programming.
<br></ul>
<br>
<br>
<br>六、成績考核 (Grading)
<br>
<br>Homework 20%, two midterm exams 50%, and final exam 30%.
<br>
<br>
<br>七、可連結之網頁位址 (Web Page)
<br>
<br><a target="_blank" href="http://www.ee.nthu.edu.tw/ccchao/ee2060/">http://www.ee.nthu.edu.tw/ccchao/ee2060/</a>
<br>
<br>