一、課程說明 (Course Description)

This course is about the study of discrete objects, and is one of the

foundation courses in Computer Science.

We will introduce a couple of basic concepts, and we hope that through the

understanding of these concepts,

we can strengthen our ability to understand a problem formulation, define a new

problem, think critically,

and analyse the correctness and efficiency of a solution to a problem.

二、指定用書 (Text Book)

Discrete Mathematics and Its Applications

by K. H. Rosen

三、參考書籍 (References)

1. Introduction to Combinatorial Mathematics

by C. L. Liu

2. Discrete and Combinatorial Mathematics

by R. P. Grimaldi

四、教學方式 (Teaching Method)

Lectures and Tutorials (lectures in English; tutorial before each exam)

五、教學進度 (Syllabus)

1. Logic

2. Methods of Proving

3. Counting

4. Sets, Functions, Relations

5. Basic Graph Theory

6. Basic Number Theory (if time is available)

六、成績考核 (Evaluation)

5--6 assignments 0%

3 exams 100%

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

Total 100%

There are two formula for your final score:

(1) 20 + (average of 3 exams) * 0.8

(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/math16.html

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