The aim of the course is to introduce advanced techniques for the design and analysis of major classes of algorithms and to highlight their different application areas. In addition, the course also aims to inform students about runtime analysis techniques of algorithms, to show students how to design algorithms correctly and efficiently, and to inform students about the effective use of appropriate data structures in algorithm development.

Fundamentals of the Analysis of Algorithm Efficiency, Asymptotic Notations, Analysis of Divide and Conquer Algorithms, Hashing Algorithms, Graph Algorithms, Dynamic Programming, Backtracking, P, NP and NP-Complete Problems.

Theoretical lectures, practices, exams, discussion, question-answer, homework, individual study.

Textbook: Introduction to the Design and Analysis of Algorithms (3rd Edition) by Anany Levitin, 2011. Other resources: - The Algorithm Design Manual (2nd Edition), Steven S Skiena, 2010. - An Introduction to the Analysis of Algorithms (2nd Edition), Robert Sedgewick, Philippe Flajolet, 2013. - Lecture notes and application examples. - Online courses and course materials on the internet.