教務系統課程大綱
一、課程目標Course objectives:
Objectives: The course of Discrete Mathematics is taken by almost all students related to computer discipline. This course aims to provide elementary knowledge in all domains of discrete mathematics such as logic circuits, finite state automata, Turing machines, algorithms, relations and functions, graphs and lattices, number theory, permutations and probability.
二、師生晤談時間及地點Instructor office hours:
18~20 PM, Tuesday, 管院106或管院5060
三、授課方式Teaching approach:
課堂授課、即席抽問
四、評量方式Grading criteria:
1. 彈性評量方式: 30 %
2. 期末考試: 30 %
3. In-class participations、書面專題: 40 %
五、參考書目Textbook & references:
（一）教科書：
E. Scheinerman, Mathematics A Discrete Introduction, 3rd edition, Brooks/Cole, 2013.
（二）參考書：
S. Washburn, T. Marlowe, C. Ryan, Discrete Mathematics, Addison Wesley, 2000.
六、教學進度（週次、授課主題、教學活動、評量方式/作業、章節）
Course schedule (week, topic, activities, evaluation/assignment, text, etc.):
第1週:Syllabus & Introduction (lecture, discussions)
第2週:Fundamentals (lecture, discussions)
第3週:Collections (lecture, discussions)
第4週:Counting and relations (lecture, discussions)
第5週: Counting and relations (quiz, lecture, discussions)
第6週: Functions (lecture, discussions)
第7週: Functions (quiz, lecture, discussions)
第8週: Probability (lecture, discussions)
第9週:Mid-term Exam
第10週: Probability (quiz, lecture, discussions)
第11週: Number theory (lecture, discussions)
第12週: Number theory (lecture, discussions)
第13週: Number theory (lecture, discussions)
第14週:Graph (lecture, discussions)
第15週:Graph (lecture, discussions)
第16週:Graph (quiz, lecture, discussions)
第17週: Mathematical proof (lecture, discussions)
第18週:Final Exam
七、TA協助事項Teaching Assistant tasks:
Depending on the number of enrolled students
八、備註Remarks:
九、本課程可培養學生之核心能力與教學活動及評量方法對應表
培養學生資訊技術應用與創新能力(學士班)之教學活動: 課堂討論
培養學生資訊技術應用與創新能力(學士班)之評量方法: 紙筆考試或測驗、實作評量
Objectives: The course of Discrete Mathematics is taken by almost all students related to computer discipline. This course aims to provide elementary knowledge in all domains of discrete mathematics such as logic circuits, finite state automata, Turing machines, algorithms, relations and functions, graphs and lattices, number theory, permutations and probability.
二、師生晤談時間及地點Instructor office hours:
18~20 PM, Tuesday, 管院106或管院5060
三、授課方式Teaching approach:
課堂授課、即席抽問
四、評量方式Grading criteria:
1. 彈性評量方式: 30 %
2. 期末考試: 30 %
3. In-class participations、書面專題: 40 %
五、參考書目Textbook & references:
（一）教科書：
E. Scheinerman, Mathematics A Discrete Introduction, 3rd edition, Brooks/Cole, 2013.
（二）參考書：
S. Washburn, T. Marlowe, C. Ryan, Discrete Mathematics, Addison Wesley, 2000.
六、教學進度（週次、授課主題、教學活動、評量方式/作業、章節）
Course schedule (week, topic, activities, evaluation/assignment, text, etc.):
第1週:Syllabus & Introduction (lecture, discussions)
第2週:Fundamentals (lecture, discussions)
第3週:Collections (lecture, discussions)
第4週:Counting and relations (lecture, discussions)
第5週: Counting and relations (quiz, lecture, discussions)
第6週: Functions (lecture, discussions)
第7週: Functions (quiz, lecture, discussions)
第8週: Probability (lecture, discussions)
第9週:Mid-term Exam
第10週: Probability (quiz, lecture, discussions)
第11週: Number theory (lecture, discussions)
第12週: Number theory (lecture, discussions)
第13週: Number theory (lecture, discussions)
第14週:Graph (lecture, discussions)
第15週:Graph (lecture, discussions)
第16週:Graph (quiz, lecture, discussions)
第17週: Mathematical proof (lecture, discussions)
第18週:Final Exam
七、TA協助事項Teaching Assistant tasks:
Depending on the number of enrolled students
八、備註Remarks:
九、本課程可培養學生之核心能力與教學活動及評量方法對應表
培養學生資訊技術應用與創新能力(學士班)之教學活動: 課堂討論
培養學生資訊技術應用與創新能力(學士班)之評量方法: 紙筆考試或測驗、實作評量
Zuletzt geändert: Sonntag, 1. Juli 2018, 05:31