studies

Master Degree (M.Sc.) in "Informatics"

Programming Principles –Languages C, C++

Course Code MPPLAP01
Course Type Obligatory
Teaching Hours 3
ECTS: 5

Data Structures

Course Code MPPLDD01
Course Type Obligatory
Teaching Hours 3
ECTS: 5

Introduction to algorithms, asumptotic notations, basic analysis of the algorithm performance, arrays, linked lists, stacks, queues, sorting, trees, binary search trees, heaps, balanced trees (avl-trees, red-black trees), hashing, union-find structure, B-trees, applications.

On successful completion of this unit students will be able to:
1. Aptly apply the suitable data structures for solving computational problems in various application fields.
2. Evaluate the time complexity of the basic operations of data structures both analytically and experimentally.
3. Evaluate the space complexity of a data structure both analytically and experimentally.
4. Efficiently implement data structures taking into account the features of the implementation platform.

302,Central Building
+302104142322

543/CB
Phone Number /Fax:+30 210 4142312

Programming Languages and Compilers

Course Code MPPLGPM01
Course Type Obligatory
Teaching Hours 3
ECTS: 5

Professor
507/CB
+30.210.4142269

505Central Building
+302104142128

207,Central Building
+302104142131

Operating Systems

Course Code MPPLLS01
Course Type Obligatory
Teaching Hours 3
ECTS: 5

Basic principles of Operating Systems. Architecture, structure and categorization of Operating Systems. Processes and Threads. Inter-Process Communication. CPU scheduling. Memory management. Virtual memory. Memory pagination. Algorithms for memory pagination. File and folder management. File systems.

On successful completion of this unit students will be able to:
Understand basic principles of Operating Systems. Perform basic administration of modern Operating Systems.
Use Command-Line Interface.
Run and execute basic shell scripts.

302/Lam.126
+302104142123

Δρ. Ι. Αντρεου

Elective Courses

Special Topics in Mathematics

Course Code MPPLSA01
Course Type Elective
Teaching Hours 3
ECTS: 5

sets. Differentiation. Integration. Matrices. Determinants. Systems. Algebraic Structures. Boolean Algebra. Mathematical Software.

After successfully completing this course, students are expected to have acquired the basic knowledge of mathematics that are needed in Computer Science.

Sapounakis Aristides

542, CB
+30 210 4142262

Manes Konstantinos

Mathematical Logic

Course Code MPPLML01
Course Type Elective
Teaching Hours 3
ECTS: 5

Propositional Calculus. Recursive Definitions. Proof by Induction. Truth Values. Truth Assignment. Logical Implication. Satisfiability. Horn Formulas. Normal Forms. SAT Problem. Compactness Theorem. Axioms and Completeness of Propositional Calculus. Proof. Truth Trees. Resolution Principle. Mathematical Logic and Boolean Algebra. Introduction to Predicate Calculus. Quantifiers.

After successfully completing this course, students are expected to have acquired the ability to apply the basic principles of Mathematical Logic not only in their effort to solve particular problems in Mathematics and Computer Science, but more generally in order to address problems that they are facing, in a systematic, well organized and consistent way, to realize that there is a close relation between Mathematical Logic and Boolean Algebra. Students are also expected to have acquired the notions of Proof and Satisfiability, and to be able to use particular proof techniques and algorithms, such as Truth Trees and the Resolution Principle.

Tsikouras Panagiotis-George

Manes Konstantinos

Discrete Mathematics

Course Code MPPLGP01
Course Type Elective
Teaching Hours 3
ECTS: 5

Basic Notions:Sets. Relations. Mappings.Combinatorics:Orderings. Combinations. Permutations.Basic Principles:Induction. Pigeonhole. Diagonalization. Inclusion – Exclusion.Sums – Differences:Factorial Polynomials. Newton's Theorem.Boolean Algebra: Equations. Systems. Boolean Functions. Relation to Mathematical Logic.Graphs:Basic Definitons and Results.Trees:Basic Definitions and Results. Ordered Trees. Binary Trees. Traversal of Binary Trees.Languages – Automata:Basic Definitions. D-Automata. Languages and Automata

After successfully completing this course, students are expected to have acquired the basic knowledge of mathematical notions and results needed in Computer Science, i.e., the students are expected to be able to use some basic mathematical principles, to manipulate sums and differences, as well as to be familiar with the basic notions and results in Set Theory, Combinatorics, Graph Theory, Boolean Algebra, Languages and Automata.

Sapounakis Aristides

542, CB
+30 210 4142262

542, CB
+30 210 4142313

Manes Konstantinos

Logic Programming

Course Code ΜΠΠΛΛΠ01
Course Type Elective
Teaching Hours 3
ECTS: 5