Course Syllabus

Course Information：

Year-Semester Course Number Course Name Phase Credits Hours Required/Elective Instructor Class Student NO. Withdraw Note

Fall Semester
Year 2026 362393 Discrete Mathematics 1 3.0 3 ▲ Chun-Ling Lin 4EN2A 50 0 　

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Fall Semester Year 2026	362393	Discrete Mathematics	1	3.0	3	▲	Chun-Ling Lin	4EN2A	50	0

Course Plan：

Instructor Chun-Ling Lin　Office Hours

Email ginnylin@ntut.edu.tw

Last Updated 2026-06-01 11:03:51

Course Objective Course Introduction Discrete mathematics is a branch of mathematics devoted to the study of discrete objects (i.e., objects that are distinct and unconnected). This course will introduce and apply various discrete structures and techniques to solve real-world problems. Main Topics 1. The Foundations: Logic and Proofs o Understanding the fundamentals of logical reasoning and constructing mathematical proofs. 2. Basic Structures: Sets, Functions, Sequences, Sums, and Matrices o Exploring fundamental mathematical structures used in computer science and mathematics. 3. Algorithms o Designing and analyzing algorithms for various computational problems. 4. Number Theory and Cryptography o Applying number theory in cryptographic algorithms and understanding their mathematical underpinnings. 5. Counting o Learning basic counting principles and techniques, including permutations and combinations. 6. Discrete Probability o Introducing probability theory with discrete random variables and their applications. 7. Advanced Counting Techniques o Delving deeper into combinatorial analysis and advanced counting methods. 8. Relations o Examining relations and their properties, including equivalence relations and partial orderings. Learning Objectives • Development of Mathematical Thinking and Logical Reasoning: Cultivate the ability to understand and create mathematical arguments, laying the foundation for advanced mathematical studies. • Foundations in Computer Science: Provide the necessary mathematical background for advanced courses in computer science, such as data structures, algorithms, compiler theory, and more. • Operations Research and Applications: Equip students with the mathematical background required to solve problems in operations research, chemical engineering, biology, and related fields. Course Features • Emphasis on Problem-Solving: The course focuses on teaching mathematical reasoning and problem-solving rather than merely imparting skills. • Fostering Creativity and Critical Thinking: Through diverse topics and problems, students are encouraged to apply their knowledge to new challenges. • Practice in Mathematical Proofs: Students will learn how to read, write, and validate mathematical proofs, which will be valuable for advanced courses. This course aims to equip students with the necessary tools and skills to tackle challenges in future courses and professional work.

Course Schedule Week 1: The Foundations: Logic and Proofs • Introduction to Propositional Logic • Logical Equivalences and Quantifiers Week 2: The Foundations: Logic and Proofs • Methods of Proof • Proof Strategies and Techniques Week 3: Basic Structures: Sets, Functions, Sequences, Sums, and Matrices • Introduction to Sets and Operations • Functions and Their Properties Week 4: Basic Structures: Sets, Functions, Sequences, Sums, and Matrices • Sequences and Summations • Introduction to Matrices Week 5: Algorithms • Definition and Complexity of Algorithms • Algorithmic Problem-Solving Week 6: Number Theory and Cryptography • Basic Concepts in Number Theory • Introduction to Cryptography Week 7: Counting • Basic Counting Principles • Permutations and Combinations Week 8: Counting • Advanced Counting Methods • Inclusion-Exclusion Principle Week 9: Midterm Exam Week 10: Discrete Probability • Introduction to Discrete Probability • Probability Rules and Bayes’ Theorem Week 11: Discrete Probability • Expected Value and Variance • Applications of Discrete Probability Week 12: Advanced Counting Techniques • Generating Functions • Recurrence Relations Week 13: Advanced Counting Techniques • Pigeonhole Principle • Applications of Advanced Counting Techniques Week 14: Relations • Introduction to Relations • Properties of Relations Week 15: Relations • Equivalence Relations • Partial Orders Week 16: Relations • Representing Relations: Matrices and Digraphs • Applications of Relations Week 17: Review and Practice • Comprehensive Review of Key Concepts • Practice Problems and Solutions Week 18: Final Exam

Evaluation and grading policy 40% Pop quiz+ Homework 30% Midterm exam 30% Final exam

Materials All right reserved. Do not reproduce without permission.

Foreign-language textbooks:Yes
Discrete Mathematics and Its Applications 作者：Kenneth Rosen ISBN：9781260091991 年份：2019 出版商：McGraw-Hill 參考網頁：Discrete Mathematics and Its Applications 8/e

The access to curricular consultation 1. Teacher office hours for @綜科館 312-1:Monday. 09:00 ~ 12:00, Tuesday 09:00~ 12:00.
2. Please email ginnylin@mail.ntut.edu.tw to reserve the time for face-to-face or online curricular consultation in advance.

Expanding teaching and resources ● 參與式創新教學 (Participatory & Innovative Teaching)
強調學生參與與產出，導入翻轉、PBL/專題、設計思考或遊戲化等策略。
Emphasizes student engagement and outcomes by adopting strategies such as Flipped Classroom, PBL (Problem/Project- Based Learning), Design Thinking, or Gamification.

The course corresponds to the SDGs SDG4：優質教育（Quality Education）
SDG9：產業創新與基礎設施（Industry, Innovation and Infrastructure）

Does the course incorporate AI ● 使用生成式AI作為教學過程的輔助工具（Use generative AI tools as an aid to the teaching process）
● 鼓勵學生使用生成式AI工具（Encourage students to use generative AI tools）
● 使用生成式AI進行課堂即時互動（Use generative AI for real-time classroom interaction）

Note
　

Instructor	Chun-Ling Lin　Office Hours
Email	ginnylin@ntut.edu.tw
Last Updated	2026-06-01 11:03:51
Course Objective	Course Introduction Discrete mathematics is a branch of mathematics devoted to the study of discrete objects (i.e., objects that are distinct and unconnected). This course will introduce and apply various discrete structures and techniques to solve real-world problems. Main Topics 1. The Foundations: Logic and Proofs o Understanding the fundamentals of logical reasoning and constructing mathematical proofs. 2. Basic Structures: Sets, Functions, Sequences, Sums, and Matrices o Exploring fundamental mathematical structures used in computer science and mathematics. 3. Algorithms o Designing and analyzing algorithms for various computational problems. 4. Number Theory and Cryptography o Applying number theory in cryptographic algorithms and understanding their mathematical underpinnings. 5. Counting o Learning basic counting principles and techniques, including permutations and combinations. 6. Discrete Probability o Introducing probability theory with discrete random variables and their applications. 7. Advanced Counting Techniques o Delving deeper into combinatorial analysis and advanced counting methods. 8. Relations o Examining relations and their properties, including equivalence relations and partial orderings. Learning Objectives • Development of Mathematical Thinking and Logical Reasoning: Cultivate the ability to understand and create mathematical arguments, laying the foundation for advanced mathematical studies. • Foundations in Computer Science: Provide the necessary mathematical background for advanced courses in computer science, such as data structures, algorithms, compiler theory, and more. • Operations Research and Applications: Equip students with the mathematical background required to solve problems in operations research, chemical engineering, biology, and related fields. Course Features • Emphasis on Problem-Solving: The course focuses on teaching mathematical reasoning and problem-solving rather than merely imparting skills. • Fostering Creativity and Critical Thinking: Through diverse topics and problems, students are encouraged to apply their knowledge to new challenges. • Practice in Mathematical Proofs: Students will learn how to read, write, and validate mathematical proofs, which will be valuable for advanced courses. This course aims to equip students with the necessary tools and skills to tackle challenges in future courses and professional work.
Course Schedule	Week 1: The Foundations: Logic and Proofs • Introduction to Propositional Logic • Logical Equivalences and Quantifiers Week 2: The Foundations: Logic and Proofs • Methods of Proof • Proof Strategies and Techniques Week 3: Basic Structures: Sets, Functions, Sequences, Sums, and Matrices • Introduction to Sets and Operations • Functions and Their Properties Week 4: Basic Structures: Sets, Functions, Sequences, Sums, and Matrices • Sequences and Summations • Introduction to Matrices Week 5: Algorithms • Definition and Complexity of Algorithms • Algorithmic Problem-Solving Week 6: Number Theory and Cryptography • Basic Concepts in Number Theory • Introduction to Cryptography Week 7: Counting • Basic Counting Principles • Permutations and Combinations Week 8: Counting • Advanced Counting Methods • Inclusion-Exclusion Principle Week 9: Midterm Exam Week 10: Discrete Probability • Introduction to Discrete Probability • Probability Rules and Bayes’ Theorem Week 11: Discrete Probability • Expected Value and Variance • Applications of Discrete Probability Week 12: Advanced Counting Techniques • Generating Functions • Recurrence Relations Week 13: Advanced Counting Techniques • Pigeonhole Principle • Applications of Advanced Counting Techniques Week 14: Relations • Introduction to Relations • Properties of Relations Week 15: Relations • Equivalence Relations • Partial Orders Week 16: Relations • Representing Relations: Matrices and Digraphs • Applications of Relations Week 17: Review and Practice • Comprehensive Review of Key Concepts • Practice Problems and Solutions Week 18: Final Exam
Evaluation and grading policy	40% Pop quiz+ Homework 30% Midterm exam 30% Final exam
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes Discrete Mathematics and Its Applications 作者：Kenneth Rosen ISBN：9781260091991 年份：2019 出版商：McGraw-Hill 參考網頁：Discrete Mathematics and Its Applications 8/e
The access to curricular consultation	1. Teacher office hours for @綜科館 312-1:Monday. 09:00 ~ 12:00, Tuesday 09:00~ 12:00. 2. Please email ginnylin@mail.ntut.edu.tw to reserve the time for face-to-face or online curricular consultation in advance.
Expanding teaching and resources	● 參與式創新教學 (Participatory & Innovative Teaching) 強調學生參與與產出，導入翻轉、PBL/專題、設計思考或遊戲化等策略。 Emphasizes student engagement and outcomes by adopting strategies such as Flipped Classroom, PBL (Problem/Project- Based Learning), Design Thinking, or Gamification.
The course corresponds to the SDGs	SDG4：優質教育（Quality Education） SDG9：產業創新與基礎設施（Industry, Innovation and Infrastructure）
Does the course incorporate AI	● 使用生成式AI作為教學過程的輔助工具（Use generative AI tools as an aid to the teaching process） ● 鼓勵學生使用生成式AI工具（Encourage students to use generative AI tools） ● 使用生成式AI進行課堂即時互動（Use generative AI for real-time classroom interaction）
Note