Course Syllabus

Course Information：

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Fall Semester Year 2020	277117	Discrete Mathematics	1	3.0	3	▲	Tsai,Ming-Cheng	IEECSU1	19	0	◎

Course Plan：

Instructor	Tsai,Ming-Cheng
Email	mctsai2@gmail.com
Last Updated	2020-09-13 23:27:25
Course Objective	A discrete mathematics course has many purposes. Students should learn a particular set of mathematical facts and how to apply them. Moreover, such a course should teach students how to think logically and mathematically. This course will include: 1. The fundamentals of discrete mathematics. 2. Combinatory. 3. The theory and applications of finite graphs and applied algebra. 4. Discrete mathematics in computer science.
Course Schedule (Week 1-16)	1. Logic and Proofs 2. Sets, Functions, Sequences, Sums, and Matrices 3. Algorithms 4. Elementary Number Theory and Cryptography 5. Induction and Recursion 6. Counting 7. Discrete Probability 8. Advanced Counting Techniques 9. Relations 10. Graphs 11. Trees 12. Boolean Algebra 13. Finite state machines and formal languages 14. Concrete mathematics
Evaluation and grading policy	In-class participation: 10% Quizzes: 10% Tests (not including Midterm and final exams): 25% (twice) Midterm exam: 25% Final exam: 30%
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes 1. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th Edition, McGraw-Hill, 2012. 2. Richard A. Brualdi, Introductory Combinatorics, 5th Edition
The access to curricular consultation
Expanding teaching and resources
The course corresponds to the SDGs
Does the course incorporate AI
Note