Courses – Fakultet tehničkih nauka u Novom Sadu

Subject: Algorithms and Complexity - advanced topics (17.DE200)

Native organizations units: Department of Power, Electronic and Telecommunication Engineering

Type of studies	Title
Doctoral Academic Studies	Power, Electronic and Telecommunication Engineering (Year: 1, Semester: Summer)

General information:

Category	Scientific-professional
Scientific or art field	Electronics
ECTS	10

The course objective is to enable students to acquire knowledge on the advanced theoretical aspects of algorithms and their complexity including the examples of algorithms applied to different fields of Electrical and Computer Engineering.

Students who successfully complete the course will acquire knowledge on the advanced theoretical aspects of algorithms and their complexity including naive and formal aspects of algorithms, asymptotic notations, complexity class hierarchy, different levels of algorithm complexity, the reduction of problems and advanced algorithmic techniques in solving various problems in the field of Electrical and Computer Engineering

Problems and algorithmic solutions, alphabets and languages, machines and elementary operations, asymptotic notations, analysis of algorithms, algorithm techniques, concept of algorithmic complexity, computability, Turing machine, recursive functions, complexity classes and relations between complexity classes, reduction and completeness, P, NP and co-NP classes and Cook-Levin Theorem.

Classes, tutorials, study research work.

Authors	Title	Year	Publisher	Language
Christos H. Papadimitriou	Computational Complexity	1993	Addison-Wesley	English
Cormen, T.H. et al.	Introduction to Algorithms	2009	MIT Press, Cambridge	English