Department of Informatics and Telematics

Algorithms and Complexity

ΥΠ25 - Algorithms and Complexity

General Information

School: Digital Technology

Department: Informatics and Telematics

Level: Undergraduate

Course Title: Algorithms and Complexity

Course id: ΥΠ25

Type: Core Course 

Semester: 6

Teaching and Examination Language: Greek

Is the course offered in Erasmus: Yes

Course web-page: https://eclass.hua.gr/courses/DIT110/

Activities

Lectures (Theory): 3,0

Lab lectures: 0,0

ECTS credits: 5,0

Learning Outcomes

The objective of this course is for students to become familiar with the design and analysis of algorithms for the solution of basic problems. Students will learn:
Basic algorithm design techniques,
basic techniques for measuring and evaluating the performance of algorithms,
complexity classes like P, NP and EXP
NP-Completeness and NP-Hardness and techniques to deal with it.

General Skills

Independent work
Promoting free, creative and deductive thought

Course Content

1st week (lecture): Introduction.
2nd week (lecture): Analysis of Algorithms
3rd week (lecture): Graph Algorithms
4th week (lecture): Greedy Algorithms Ι
5th week (lecture): Greedy Algorithms ΙΙ
6th week (lecture): Divide & Conquer Ι
7th week (lecture): Divide & Conquer ΙΙ
8th week (lecture): Dynamic Programming Ι
9th week (lecture): Dynamic Programming ΙΙ
10th week (lecture): Networks, Max Flow Min Cut
11th week (lecture): NP & Intractability Ι
12th week (lecture): NP & Intractability II
13th week (lecture): Dealing with NP-Completeness

Learning and Teaching Methods - Evaluation

Teaching methods: face-to-face

Use of ICT: 

eclass platform, youtube channel

Course Organization

 

Activity

Semester work load

Lectures

39,0

Lab exercises

0,0

Individual of group projects

18,0

Lab report preparation

 

Thesis 

 

Independent Study

68,0

Total

125

Assessment

Ι. Written Examination entailing
Theory
Exercises

Literature

Jon Kleinberg & Eva Tardos. Algorithm Design. Pearson Education, 2013.
Cormen, Leiserson, Rivest & Stein. Introduction to Algorithms. MIT Press. Third Edition. 2009.