Course Details

Course Code (English)*

Semester*

Title (English)*

Lecture Hours (Weekly)

ECTS Credits*

Course Type (English)

Prerequisites (English)

Course URL (e.g., on e-class)

Learning Outcomes (English) The objective of this course is to offer a concise understanding of the basic principles of Discrete Mathematics, the Mathematics of Computer Science

General Competencies (English) Search, analysis and synthesis of data and information Adaptation in new conditions Decision Making Independent work Work at an interdisciplinary framework Formulation of new research ideas Promoting reasoning and self improvement Promoting free, creative and deductive reasoning

Course Content (English) 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

Use of ICT (English) Support the learning process through the electronic platform e-class

Is it elective? Άγνωστο Ναι Όχι

Load within semester (Hours)

Lecture Hours

Lab Hours

Independent Study*

Project Work*

Lab Report*