ΥΠ09 - Discrete Mathematics

Information

Code : ΥΠ09

Type : Obligatory

Semester : 1

ECTS credits: 6

Course URL: http://eclass.hua.gr/courses/DIT144/

Expected Outcomes

The objective of this course is to offer a concise understanding of the basic principles of Discrete Mathematics, the Mathematics of Computer Science

Content

1. Elementary Combinatorics: Basic Counting Principles, Permutations and Combinations
2. Generating Functions
3. Recurrence Relations
4. Distributions and Occupancy
5. Applications of the topics of the three first lectures to Computer Science
6. Plya enumeration theorem
7. Inclusion-Exclusion Principle.
8. Applications of the topics of the 6th and 7th lectures to Computer Science
9. Basic Principles of Graph Theory: Graphs, Euler and Hamiltonian Graphs
10. Graph Coloring
11. Trees
12. Applications of Graph Theory to Computer Science

Evaluation Means

Bibliography

1. C.L. Liu 2007. Elements of Discrete Mathematics. MCGRAW HILL COMPUTER SCIENCE SERIES.
2. G. Voutsadakis, E. Kirousis, Ch. Bouras, P. Spyrakis 2008. Discrete Mathematics. Mathematics of Computer Science. Gutenberg Publishers. Athens. in Greek