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) |
