一、課程說明 (Course Description)



This course is an extension to the Discrete Mathematics. We will introduce a 

couple of interesting and useful combinatorial mathematics tools and concepts, 

and we hope that by mastering these techniques, we can strengthen our problem 

solving abilities.



Most of our topics have direct application to important CS areas, including 

coding, crypotography, network design, data compression, theory of 

computation, and analysis of algorithms.





二、指定用書 (Text Book)  

    Introduction to Combinatorial Mathematics

    by C. L. Liu



三、參考書籍 (References)   

    1. Discrete Mathematics and Its Applications, by K. H. Rosen  

    2. Introduction to Algorithms, by T. H. Cormen and others

    3. Concrete Mathematics,       by R. Graham and others



四、教學方式 (Teaching Method)  

    Lectures and Tutorials (Lectures in English)



五、教學進度 (Syllabus)



    1.  Permutations and Combinations

    2.  Generating Functions

    3.  Recurrence Relations

    4.  Methods of Proving

    5.  Number Theory

    6.  Group Theory

    7.  Automata Theory



六、成績考核 (Evaluation)   

    5-7 assignments    0%  

    3 exams          100%

    ---------------------

    Total            100%



    There are two formula for your final score:

    (1) 30 + (average of 3 exams) * 0.7

    (2) (average of the best 2 exams) * 0.8 + (the worst one) * 0.2

    

    Final score = Maximum of (1) and (2).



七、可連結之網頁位址 (Web links) 

    Slides: http://www.cs.nthu.edu.tw/~wkhon/comb16.html 

    NTHU OCW: http://ocw.nthu.edu.tw/ocw/index.php?page=course&cid=142&