## General Information

### Class meetings:

Tuesday

Thursday

Friday

Thursday

Friday

15:00-17:00, ΡΑ 101

13:00-15:00, ΡΑ 101

13:00-15:00, ΡΑ 101

13:00-15:00, ΡΑ 101

13:00-15:00, ΡΑ 101

### Instructor:

Menelaos KaravelasOffice: Γ114, White Bldg.

Phone: 2810 393 706

email:

__mkaravel at tem uoc gr__**Office Hours:**Tu 17:00-18:00, Th 15:00-16:00

### Class textbook:

C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill, 2nd Edition, 1985.### Course Objectives:

Familiarity with basic notions of discrete
mathematics, such as sets, propositions, combinations,
discrete probability, gaphs, trees. Introduction to
basic algorithms for graphs and trees. Introduction to
the theory of groups and rings. Introduction to
computability, formal languages, finite state machines
(automata), analysis of algorithms, recurrence
relations and Boole algebras.

### References:

- Μ. Κολουντζάκης,
*Διακριτά Μαθηματικά*(in greek). PDF Postscript - M. Sipser,
*Introduction to the Theory of Computation*, PWS Publishing Company, 2nd Edition, 1997.