層級: | 課程資料 |
媒體: | 影音 |
2021-08-07-2030-12-30
國立清華大學 資訊工程學系 韓永楷
關鍵字: Discrete Mathematics Logical operatoers Predicate Valid argument forms Pigeonhole Principle Combinations & Penmutations
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......
♠ | Discrete Mathematics and Its Applications by K. H. Rosen |
♠ | ntroduction to Combinatorial Mathematics by C. L. Liu |
♠ | iscrete and Combinatorial Mathematics by R. P. Grimaldi |
♠ | Lectures and Tutorials |
(Lectures in English, Tutorial before Each Exam) |
♠ 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) |