6st semester

Course: Analysis and Design of Algorithms

Description:

Course title

Algorithms Analysis and Design

Course code

ΜΚ37

Course type

Compulsory

Course level

Undergraduate (first cycle)

Year of studies

3rd

Semester

6th

ECTS Credits

5

URL

eclass.uowm.gr/courses/ICTE311/

Hours per week

4

Course content

Analysis of Algorithms, Complexity of Algorithms, Asymptotic Analysis. Algorithms Design, Recursive Algorithms, Divide-and-Conquer Algorithms, Dynamic Programming, Greedy algorithms, probabilistic algorithms.

Graph and Networks Algorithms. Computational Complexity, classes P and NP, NP-completeness.

Expected 
learning outcomes and competences to be acquired

Upon successful completion of this course, students will be able:

  • to perform analysis of algorithms,
  • to study algorithmic complexity
  • to perform asymptotic analysis
  • to implement recursive and greedy algorithms,
  • to implement algorithms by applying the principles of dynamic programming,
  • to understand and apply algorithms for graphs and networks,
  • to understand the classes P and NP.

Prerequisites

None

Teaching methods

Lectures, theoretical exercises, development exercises

Assessment methods

Two mandatory exercises with oral examination (30%)

Final written examination (70%)

Language of instruction

Greek

Recommended bibliography

[1]     CORMEN T.H., LEISERSON C.E., RIVEST R.L., STEIN C., ΕΙΣΑΓΩΓΗ ΣΤΟΥΣ ΑΛΓΟΡΙΘΜΟΥΣ, ΤΟΜΟΣ Ι, ΠΑΝΕΠΙΣΤΗΜΙΑΚΕΣ ΕΚΔΟΣΕΙΣ ΚΡΗΤΗΣ, 2009.

[2]     SANJOY DASGUPTA, CHRISTOS PAPADIMITRIOU, UMESH VAZIRANI, ΑΛΓΟΡΙΘΜΟΙ, ΕΚΔΟΣΕΙΣ ΚΛΕΙΔΑΡΙΘΜΟΣ, 2009.

[3]     Μποζάνης Παναγιώτης Δ., Αλγόριθμοι, ΕΚΔΟΣΕΙΣ Α. ΤΖΙΟΛΑ & ΥΙΟΙ Α.Ε., 2006.



Lecturer: Kiriakidis Thomas