• Logic and Proofs.
• Finite and Infinite Sets.
• Computability.
• Formal Languages and Grammars.
• Permutations.
• Combinations and Discrete Probability.
• Relations and Functions.
• Graphs and Trees.
• Finite State Machines.
• Discrete Numeric Functions and Generating Functions.
• Algorithms and Complexity.
• Recursive Relations.

Upon successful completion of this course, students will:
• understand methods for solving discrete mathematical
problems
• apply solution methods to unknown problems
• developing problem-solving skills and creative thinking
• understand the basics of set theory
• understand the basics of computability
• understand the basics of formal languages and grammars
• be able to calculate permutations and computations
• be able to solve basic problems in graphs and trees
• be able to study discrete numeric functions
• understand the basics of algorithmic complexity
• be able to calculate recursive functions
General Competences:
• Search for, analysis and synthesis of data and information
by the use of appropriate technologies
• Decision-making
• Individual/Independent work
• Algorithmic thinking
• Solve complex algorithmic problems

None

The assessment method consists of two intermediate written
examinations (20%) and a final written examination (80%). The
intermediate and final examinations include multiple choice
questions, short answer questions, and problem-solving questions.
The above evaluation criteria are posted on the course website.

- Recommended Book Resources:
1. Rosen Kenneth H., Διακριτά μαθηματικά και εφαρμογές τους, Εκδόσεις Α. Τζιόλα, Έκδοση:
8η/2018
2. Lipschutz Seymour, Lipson Marc Lars, Διακριτά μαθηματικά, Εκδόσεις Α. Τζιόλα, Έκδοση: 2η
έκδ./2003
3. Liu C.L., Στοιχεία διακριτών μαθηματικών, Πανεπιστημιακές Εκδόσεις Κρήτης, Έκδοση: 1η/2009
- Related Scientific Journals:
1. Discrete Mathematics
2. SIAM Journal on Discrete Mathematics
3. Discrete Mathematics and Applications