Algorithms Design

Introducing students to basic elements of numerical complexity and algorithm analysis, as well as to the principles of problem solving algorithms in different fields (graph theory, algebra, geometry, arrays and sets).зова и скупова).

Students will learn to independently create algorithms and determine their numerical complexity;

Theoretical training
• The definition of algorithms;
• Recording algorithms;
• Algorithm design;
• Analysis of algorithms;
• The asymptotic execution time of the algorithm;
• Notation of the algorithm;
• Iterative and recursive algorithms;
• Analysis of recursive algorithms;
• Recurrent equations;
• Handling basic structures.
Practical training
Independent creation of algorithms in the field taught in the lecture and checking the complexity of algorithms.

Д. Живковић, Методи писања и анализе алгоритама, Сингидунум, Београд, 2015.

М. Живковић, Алгоритми, ПМФ, Београд, 2000

Б. Јошанов, З. Будимац, Пројектовање алгоритама, Виша пословна школа, Нови Сад, 2000.

Theoretical training • The definition of algorithms; • Recording algorithms; • Algorithm design; • Analysis of algorithms; • The asymptotic execution time of the algorithm; • Notation of the algorithm; • Iterative and recursive algorithms; • Analysis of recursive algorithms; • Recurrent equations; • Handling basic structures. Practical training Independent creation of algorithms in the field taught in the lecture and checking the complexity of algorithms.

Assessment (maximum number of points 100)

Array

Practice classes

• др Сања Лончар