Syllabus

• Fundamental of Discrete Mathematics
• Counting
• Logic
• Set
• Mathematical Induction
• Relations and Functions
• Finite State Machines
• Enumeration
• Inclusion and Exclusion
• Generating Functions
• Recurrence Relations
• Graph
• Graph Theory
• Trees

Grading

• Homework 20%
• 2 Middle Exams: 50%
• Final Exam: 30%

Textbook & References

• Textbook: "Ralph P. Grimaldi, “Discrete and Combinatorial Mathematics," Fifth Edition, Addition-Wesley, 2004. 新月圖書代理
• MIT OCW -- Mathematics for Computer Science, Spring 2005
• MIT OCW -- Mathematics for Computer Science, Fall 2005
• "Discrete Mathematics with Proof," Eric Gossett. Prentice Hall, 高立圖書代理

TA Room 4244, email: nckudm@gmail.com

Related Information(2/23 update)

Lecture Notes (Moodle @NCKU)