Study Program / Courses Offered


  • CS - Introductory Specialization "COMPUTER SCIENCE AND TECHNOLOGY"
  • IS - Introductory Specialization "INFORMATION SYSTEMS"
2nd Semester
IS - Introductory Specialization "INFORMATION SYSTEMS"

COMPULSORY COURSES

  • COMPUTER ARCHITECTURE
    (AIC201)
  • DATA STRUCTURES
    (AIC205)
  • DATABASES
    (AIC202)
  • DISCRETE MATHEMATICS
    (AIC203)
  • MANAGEMENT AND TECHNOLOGY
    (AIC204)
  • PROBABILITY AND STATISTICS
    (ISC201)

Roumeliotis Manos   Souravlas Stavros   

Course Outlines

Semester: 2nd (Spring) | Course type: Compulsory CS-IS | Weekly hours: 3 | ECTS: 5

Instructors:         Roumeliotis Manos, Souravlas Stavros

General competences

Computer Architecture deals with the logic design of the basic abstraction layers that facilitate the efficient execution of computer programs, according to current digital circuit technologies, with emphasis on processor and memory operation. Students must be able to explain the organization of a typical computer system, as well as the execution of a simple program on that system. Further, students must be able to design simple digital circuits, program in simple assembly language, and estimate the performance of a simple computer system.

Course content

Introduction: Structured Computer Organization, Survey of Modern Computer Systems: Processor, Memory, Buses, I/O.

Digital Logic: Information Representation, Logic Gates and Boolean Algebra, Basic Combinatorial Circuits, Basic Sequential Circuits and Memory, Buses.

Microarchietcture: Data Paths and Memory Models, Execution of Instructions and Microisnstructions, Instruction Level Parallelism, Cache Memory, Performance Improvements.

Instruction Set Architecture: Data Types, Instruction Formats, Addressing Modes, Instruction Types, Flow Control, Assembly Language Programming.

Assessment

Optional programming assignment up to 2 additional marks

Course bibliography

(One of the following):

68374428 Ψηφιακή Σχεδίαση, 2η 'Εκδοση, Τύπος: Σύγγραμμα, Ρουμελιώτης Μάνος, Σουραβλάς Στάυρος, 2017, ΤΖΙΟΛΑ, ISBN: 978-960-418-742-3 

94692327 Οργάνωση και Αρχιτεκτονική Υπολογιστών, 11η Έκδοση, Τύπος: Σύγγραμμα, Stallings William, 2020, ΤΖΙΟΛΑ, ISBN: 978-960-418-892-5 

15120 Οργάνωση και αρχιτεκτονική ηλεκτρονικών υπολογιστών, Τύπος: Σύγγραμμα, Hammacher Carl,Vranesic Zvonko,Zaky Safwat, 2007, Επίκεντρο, ISBN: 978-960-458-000-2 

Additional material

(http://www.etl.uom.gr/mr/index.php?mypage=archit)

Karakasidis Alexandros   Koloniari Georgia   Satratzemi Maria   

Course Outlines

Semester: 2 (Spring) | Orientation: CS-IS | Compulsory | Weekly Hours: 3 | Credit Units (ECTS): 5

Instructors: Satratzemi Maria, Koloniari Georgia, Karakasidis Alexandros

General competences

The goal of this course is the study of data structures and it is focused in two axes: a) the recognition and the development of useful mathematic models (Abstract Data Types (ADT)) and their functions as well as the determination of categories of problems that they can solve, and b) the development of methods of representation for the objects of abstract data models and the implementation of their functions in the procedural programming language C.

Course Content

1. Introduction to data structures, Abstract Data Type (ADT)
2. Stacks, basic operations, implementing Stacks with arrays and records, application of Stacks.
3. Queues, basic operations, implementing Queues with arrays and records, application of Queues.
4. Lists, basic operations, sequential storage implementation of Lists.
5. Introduction to Linked Lists, array-based implementation of Linked Lists. A pointer-based implementation of Linked Lists. A pointer-based implementation of Stacks and Queues. Application of Lists.
6. Trees, Binary Trees, basic operations. A pointer-based implementation of Binary Trees. A recursive implementation of Binary Trees. Application of Binary Trees: Huffman Codes. Full Binary Trees, Minimum/Maximum Trees, Heap.
7. Hashing, open probing, chaining, implementation of Hash table.
8. B-Trees, basic operations.
9. AVL Trees, basic operations.

Assessment

Written Examination 80%
Compulsory Assignments 20%

Bibliography

(One of the following):
77112308 Δομές Δεδομένων με C, Τύπος: Σύγγραμμα, Νικόλαος Μισυρλής, 2017, ΕΘΝΙΚΟ ΚΑΙ ΚΑΠΟΔΙΣΤΡΙΑΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ, ISBN: 978-960-466-181-7

18548971 Δομές δεδομένων, αλγόριθμοι και εφαρμογές C++, Τύπος: Σύγγραμμα, Sahnii Sartaj, 2004, ΤΖΙΟΛΑ, ISBN: 978-960-418-030-1

59357253 Δομές Δεδομένων, 2η Έκδοση, Τύπος: Σύγγραμμα, Μποζάνης Παναγιώτης Δ., 2016, ΤΖΙΟΛΑ, ISBN: 978-960-418-594-8

50658958 Δομές Δεδομένων και Αλγόριθμοι με Αντικειμενοστρεφή Σχεδιαστικά Μορφήματα στη C++, Τύπος: Σύγγραμμα, BrunoR. Preiss, Επιστ. Επιμ. Κώστας Κοντογιάννης, 2016, Πεδίο Α.Ε., ISBN: 978-960-546-692-3

Supplementary material

Course website (http://compus.uom.gr/INF159/)

Evangelidis Georgios   Koloniari Georgia   

Course Outlines

DATABASES (AIC202) - CS-IS

Coordinator:Evangelidis Georgios

Semester: 2nd (Spring) | Course type: Compulsory CS-IS | Weekly hours: 3 | ECTS: 5

Instructors:         Evangelidis Georgios, Koloniari Georgia

General competences

After completing the course the student will be able to: (a) design ER-diagrams for a database based on the requirements of a specific application, (b) transform an ER-diagram to a relational schema, (c) use specialized database modeling CASE tools to achieve the above, (d) derive a relational schema via normalization, (e) implement relational schemas in commercial DBMSs (e.g., Oracle) and open-source DBMSs (e.g., MySQL), (f) master relational algebra and use SQL to manage a database and (g) understand and use CQL to query and manage a graph database.

Course content

Introduction to Databases.

The ER-model (Entity-Relationship model)

The relational model - Converting an ER diagram to a relational schema

CASE tools for database design and implementation

Relational algebra

SQL (introduction, nested, aggregate and advanced queries) QBE

Normalization (functional dependencies, BCNF, 1NF, 2NF, 3NF, 4NF)

Database connectivity - JDBC

NoSQL databases (Neo4j)

Query languages for NoSQL databases (Cypher)

Assessment

Written final examination 70%

Coursework 30%

Course bibliography

(One of the following):

22694245 Συστήματα Διαχείρισης Βάσεων Δεδομένων, 3η Έκδοση, Τύπος: Σύγγραμμα, Ramakrishnan Raghu, Gehrke Joahannes, 2012, ΤΖΙΟΛΑ, ISBN: 978-960-418-411-8

12273 Βάσεις δεδομένων Α' Τόμος, Τύπος: Σύγγραμμα, Connoly Thomas,Begg Carolyn E., 2008, Χ. Γκιούρδα & ΣΙΑ ΕΕ, ISBN: 978-960-512-499-1

 

Additional material

Instructor's Notes and Transparencies

Konstantinos Giannoutakis   Petridou Sofia   

Course Outlines

Semester: 2nd (Spring) | Course type: Compulsory CS-IS | Weekly hours: 3 | ECTS: 5

Instructors:         Petridou Sofia

General competences

The study of discrete objects and relationships among them. The study and implementation of computational methods in finite algebraic structures.

Course content

1. Logic and proof: Statements and Logic - Predicates and quantifiers - Proof techniques - Mathematical induction.

2. Combinatorics: sum and product rules - rules of combinatorics - binomial coefficients.

3. Discrete probability: events and probabilities - conditional probability - random variables and expected values - covariance and correlation.

4. Relations - Operations - Structures: binary relations - representation of binary relations - properties of relations - equivalence relations and partial orders - binary operations - internal operation and equivalence classes - structures - isomorphisms.

5. Modular arithmetic - Cyclic groups: Divisibility - Euclidean algorithm - residues - "exponents" - cyclic groups - computations with big integers.

6. Rings and finite fields: the problem of generators and discrete logarithm - polynomial arithmetic and applications - Algorithms for finite fields - applications.

7. Recursion: sequences - recurrence relations - computation of sums and products.

Assessment

Written Final examination 100%

Course bibliography

(One of the following):

41960368 ΔΙΑΚΡΙΤΑ ΜΑΘΗΜΑΤΙΚΑ, Τύπος: Σύγγραμμα, Στεφανίδης Γιώργος, 2015, ΖΥΓΟΣ, ISBN: 978-618-5063-07-8 

13799 ΜΙΑ ΥΠΟΛΟΓΙΣΤΙΚΗ ΕΙΣΑΓΩΓΗ ΣΤΗ ΘΕΩΡΙΑ ΑΡΙΘΜΩΝ ΚΑΙ ΤΗΝ ΑΛΓΕΒΡΑ, Τύπος: Σύγγραμμα, VICTOR SHOUP, 2007, ΕΚΔΟΣΕΙΣ ΚΛΕΙΔΑΡΙΘΜΟΣ ΕΠΕ, ISBN: 978-960-209-990-2 

13953 ΔΙΑΚΡΙΤΑ ΜΑΘΗΜΑΤΙΚΑ ΜΕ ΕΦΑΡΜΟΓΕΣ, Τύπος: Σύγγραμμα, SUSANNA S. EPP, 2010, ΕΚΔΟΣΕΙΣ ΚΛΕΙΔΑΡΙΘΜΟΣ ΕΠΕ, ISBN: 978-960-461-325-0

 

Additional material

Fouskas Konstantinos   Kitsios Fotios   Madas Michail   Mastoras Theodoros   

Course Outlines

Semester: 2nd (Spring) | Course type: Compulsory CS-IS | Weekly hours: 3 | ECTS: 5

Instructors:         Fouskas Konstantinos, Kitsios Fotios, Mastoras Thodoris

General competences

The aim of this course is to familiarize the student with issues related to business administration, usage, and application of technology in modern companies and e-business. To this end key issues related to business administration such as the basic functions and activities of the enterprise and the importance of management for business efficiency. It will additionally examine issues related to how technology is an integral part of modern business and how managers can handle it.

Course content

Definition of Management, the role of the management science for the contemporary enterprise, Internal, and external environment analysis. Functional departments and their authorities. Management functions- Business functions. Evolution of the management science. Contemporary managerial approaches. The close interrelation of efficiency and effectiveness with the management functions and procedural approaches. Decision-making procedures. Strategic management. Leadership theories and corporate communication. Motivation theories. Management control. Social responsibility. Technology management and innovation. E-Business. Technology usage in the modern enterprise.

Assessment

Written final examination 100%

Compulsory assignment/lab tests 20%

 

Course bibliography

(One of the following):

77107313 Εισαγωγή στο Management, 2η έκδοση, έκδοση: 2/2018, Schermerhorn R. John Jr., Bachrach G. Daniel, ISBN: 9789925563098

 

Additional material

(http://compus.uom.gr/MT186/)

Nikolaidis Ioannis   

Course Outlines

Semester: 2nd (Spring) | Course type: Compulsory IS | Weekly hours: 3 | ECTS: 5

Instructors:         Nikolaidis Ioannis

General competences

The purpose of this course is for the students to get to know and familiarize themselves with some additional issues of Statistics (apart from those that they learnt about in Statistics I), which are absolutely necessary in many research and non-research projects. The students are introduced not only to Descriptive Statistics but also to Inferential Statistics (confidence intervals, hypotheses testing etc.) at first by theory and then through exercises, in order to be able to implement their knowledge in practice.

Course content

Terminology: population, sample, random variable etc.

Data collection: from the entire population or samples. Graphical and numerical presentation of data. Frequency distribution. Measures of Central Tendency and Dispersion.

Sampling distributions. Central limit theorem. Point estimation. Properties of estimators. Confidence interval estimation. Choice of sample size.

Hypotheses testing. Testing for the goodness of fit.

Regression-correlation

 

Assessment

100% final written exam, 5% for each project.

Course bibliography

(One of the following):

50657217 ΕΦΑΡΜΟΣΜΕΝΕΣ ΠΙΘΑΝΟΤΗΤΕΣ ΚΑΙ ΣΤΑΤΙΣΤΙΚΗ, Τύπος: Σύγγραμμα, ΚΟΥΤΡΟΥΒΕΛΗΣ ΙΩΑΝΝΗΣ, 2015, GOTSIS, ISBN: 978-960-9427-47-0

11365 Στατιστική, Τύπος: Σύγγραμμα, Ψωινός Δημήτριος Π., 1999, Ζήτη, ISBN: 960-431-561-7

59377478 Στατιστική Μέθοδοι Ανάλυσης για Επιχειρηματικές Αποφάσεις (4η έκδοση), Τύπος: Σύγγραμμα, Ιωάννης Χαλικιάς, 2017, Εκδοτικός Οίκος Rosili, ISBN: 978-618-5131-20-3

 

Additional material

Probability and Statistics in Engineering and Management Science. W. W. Hines, D. C. Montgomery, Ed. Wiley, 1990.

Wheelchair Blue
Accessibility Tools
Fonts PlusIncrease Text
Fonts MinusDecrease Text
ContrastHigh Contrast
GrayscaleGrayscale
Readable FontReadable Font