DEE 1533

Discrete Mathematics

Syllabus

---

Objective: Upon completion of this course, the student should be able to
       Check validity of simple logical arguments (proofs).
       Check the correctness of simple algorithms.
       Creatively construct simple instances of valid logical arguments and correct algorithms.
       Describe the definitions and properties of a variety of specific types of discrete structures.
       Correctly read, represent and analyze various types of discrete structures using standard notations.

Class time and place:
       Tuesday 9:00am-9:50am and Thursday 1:20pm-3:10pm @ ED 116

Instructor:
       Chia-Tso Chao (趙家佐)  
       Email: mango@faculty.nctu.edu.tw
       Office: ED625, ext. 31671
       Office hours: 4CD (made by appointment)

Teaching assistants:
       張玟翔 (o0000032@yahoo.com.tw)@ ED 612 (ext. 54178)
       黃子軒 (sto10219@hotmail.com)@ ED 612 (ext. 54178)
       陳力德 (mark920435@gmail.com)@ ED 612 (ext. 54178)

Text Book:
        Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th ed., McGraw-Hill, 2013.

Course webpage:
http://tiger.ee.nctu.edu.tw/course/Discrete2015/index.htm

Reference:
       C. L. Liu, Elements of Discrete Mathematics, 2nd ed., McGraw-Hill, 1998.

Grading:
        Quizzes                   30% (八次取六次最高)
        Midterms                35%
        Final                       35%

Course Contents:
       The Foundations: Logic and Proofs
       Basic Structures: Sets, Functions, Sequences, and Sums
       The Fundamentals: Algorithms and the Integers
       Induction and Recursion
       Counting
       Advanced Counting
       Relations
       Graphs