Course ID 16ST52
Programme
  • Applied Informatics
ESPB 7
Number of classes 3+3
Semester 1
Status Core
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).zova i skupova).
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.
D. Živković, Metodi pisanja i analize algoritama, Singidunum, Beograd, 2015.

M. Živković, Algoritmi, PMF, Beograd, 2000

B. Jošanov, Z. Budimac, Projektovanje algoritama, Viša poslovna škola, Novi Sad, 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