Semester 2

Course: Discrete Mathematics

Course Code: ΜΚ12
Course Level: Undergratuate
Obligatory/Elective: Obligatory
Semester: 2
Division: Main Course
Group: Main Course
ECTS Credits: 5
Hours Per Week: 4
Language: Greek

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.

Learning Results:

Upon successful completion of this course, students will: 

  • 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


Teaching Methods:

Lectures, exercises


Written intermediate exams (20%), Written final exams (80%)

Suggested Books:
  1. Rosen Kenneth H., Διακριτά μαθηματικά και εφαρμογές τους, Εκδόσεις Α. Τζιόλα, Έκδοση: 8η/2018
  2. Lipschutz Seymour, Lipson Marc Lars, Διακριτά μαθηματικά, Εκδόσεις Α. Τζιόλα, Έκδοση: 2η έκδ./2003
  3. Liu C.L., Στοιχεία διακριτών μαθηματικών, Πανεπιστημιακές Εκδόσεις Κρήτης, Έκδοση: 1η/2009
Lecturer: Ploskas Nikolaos