Discrete Mathematics

Semester:
1st
Course Type:
Compulsory courses (YM)
Track:
-
Code:
Κ09
ECTS:
7
TEACHING HOURS per week
Theory:
4
Seminar:
2
Laboratory:
-
Specializations
Foundations of Computer Science (S1):
-
Data and Knowledge Management (S2):
-
Software (S3):
-
Hardware and Architecture (S4):
-
Communications and Networking (S5):
-
Signal and Information Processing (S6):
-
Related Courses
Prerequisites:
-
Expected Prior Knowledge:
-
Detailed Description
DIT_PPS_K09-DiscreteMathematics.pdf
Course Content
Introduction to the following concepts: Sets, Mathematical logic and iduction, binary relations, functions, combinations and permutations, discrete probability distributions, conditional probability, independent events, Bayes theorem, asymptotic behavior of arithmetic functions. Seminar exercises are given as well as a final test.
LITERATURE AND STUDY MATERIALS - READING LIST
  •  K.H. Rosen. Discrete Mathematics and its Applications (6th Edition). McGraw-Hill, 2007.
  •  C.L. Liu. Elements of Discrete Mathematics. Crete University Press, 2003.
  •  L. Kirousis, C. Bouras, P. Spiraki. Discrete Mathematics with Applications. Gutenberg, 2004.
  •  H. Cormen, E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms. Crete University Press.
e-Class link
Διακριτά Μαθηματικά - ECLASS

Διδάσκων