Course: Analysis and Design of Algorithms
|Course title||Algorithms Analysis and Design|
|Course level||Undergraduate (first cycle)|
|Year of studies||3nd|
|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:
|Teaching methods||Lectures, theoretical exercises, development exercises|
|Assessment methods||Two mandatory exercises with oral examination (30%)
Final written examination (70%)
|Language of instruction||Greek|
Lecturer: Ploskas Nikolaos