Course Details

Course Code (English)*

Semester*

Title (English)*

Lecture Hours (Weekly)

ECTS Credits*

Course Type (English)

Prerequisites (English)

Course URL (e.g., on e-class)

Learning Outcomes (English) 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 Competencies (English) Independent work Promoting free, creative and deductive thought

Course Content (English) 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

Use of ICT (English) eclass platform, youtube channel

Is it elective? Άγνωστο Ναι Όχι

Load within semester (Hours)

Lecture Hours

Lab Hours

Independent Study*

Project Work*

Lab Report*