he goal is the introduction to fundamental notions and techniques of discrete mathematics, which constitute the basis for almost all theoretical courses, with applications ranging from network design to databases. In this sense, students acquire fundamental mathematical tools in Computer Science.
Course Content (Syllabus)
Basic elements of Propositional and Predicate Logic, Proof Techniques, Number Systems - Basic Elements of Number Theory, Sets, Functions - Relations, Recurrences, Sums and Asymptotic Notation, Basic Elements of Counting - Combinations and Permutations of Objects, Discrete Probability, Graphs and Trees.
Propositional Logic, Predicate Logic, Combinatorics, Relations, Probability, Graphs
Additional bibliography for study
1. D.E. Ensley και J.W. Crawley. Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns and Games. Wiley, 2006.
2. R.L. Graham, D.E. Knuth και O. Patashnik. Concrete Mathematics. Addison-Wesley, 1988.