國立清華大學資訊工程學系 特聘教授
香港大學計算機科學系 博士
| 【經歷】 | 國立清華大學97、103、110傑出教學獎 |
| 【網站】 | https://scholar.google.com/citations?user=7bMQ4KAAAAAJ&hl=en |
| 【授課】 | 資料結構、離散數學、隨機演算法 |
| 【專長】 | 資料結構、演算法 |
授課老師
課程試聽
韓永楷 教授
最新消息
課程大綱
This course is about the study of discrete objects, and is one of the foundation courses in Computer Science. We will introduce a couple of basic concepts, and we hope that through the understanding of these concepts, we can strengthen our ability to understand a problem formulation, define a new problem, think critically......
Course Description
This course is about the study of discrete objects, and is one of the foundation courses in Computer Science. We will introduce a couple of basic concepts, and we hope that through the understanding of these concepts, we can strengthen our ability to understand a problem formulation, define a new problem, think critically, and analyse the correctness and efficiency of a solution to a problem.
Text Book
| ♠ |
References
| ♠ | ntroduction to Combinatorial Mathematics by C. L. Liu |
| ♠ | iscrete and Combinatorial Mathematics by R. P. Grimaldi |
Teaching Method
| ♠ | Lectures and Tutorials |
| (Lectures in English, Tutorial before Each Exam) |
Syllabus
Here are the topics that I intend to cover:
Here are the topics that I intend to cover:
| ♠ Logic | (Propositional Logic, Predicate,Calculus, Rules of Inference) |
| ♠ Proofs | (Methods and Strategies, Math,Induction, Pigeonhole Principle) |
| ♠ Counting | (Basic, Permutation andCombination) |
| ♠ Sets, | Functions, and Relations |
| ♠ Graphs | (Introduction, Euler and Hamilton, Paths, Planar Graphs) |
| ♠ Trees | (Introduction, Optimal Prefix Code,Minimu Spanning Trees) |
回頂端- 英文課程
- Offered in English
- Discrete Mathematics
- Logical operatoers
- Predicate
- Valid argument forms
- Pigeonhole Principle
- Combinations & Penmutations
