Discrete Mathematics
General
Code: ΥΠ09
Language: Greek
Delivery: Face-to-face
Prerequisites:
Workload
- Lectures: 39.0 hours
- Lab: 0.0 hours
- Study: 86.0 hours
- Project: 0.0 hours
Course 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
Learning Outcomes
The objective of this course is to offer a concise understanding of the basic principles of Discrete Mathematics, the Mathematics of Computer Science
Skills
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