To acquire basic knowledge of data structures, fundamental algorithms, algorithm analysis and algorithm design techniques.

Upon completion of the course, the student has basic knowledge of data structures, algorithm design techniques and algorithm analysis. He/she is able to apply adopted knowledge to solve new problems.

- Introduction to the design and analysis of algorithms, - Proving algorithms correct and algorithm complexity analysis, - Inductive/recursive algorithm design, - Basic data structures: list, stack, queue, set, map, rooted tree, heap, binary search tree, hash table, graph, - Algorithmic strategies: two pointers technique; brute force algorithms; greedy algorithms; divide-and-conquer strategy; backtracking; branch-and-bound; dynamic programming, - Graphs: basic concepts and algorithms.

Exercises based on development of programs that implement and utilize considered algorithms and data structures.

None.

Total assigned hours: 90

New material: 45
Elaboration and examples (recapitulation): 0

Auditory exercises: 30
Laboratory exercises: 0
Calculation tasks: 0
Seminar paper: 0
Project: 0
Consultations: 0
Discussion/workshop: 0
Research study work: 0

Review and grading of calculation tasks: 0
Review and grading of lab reports: 0
Review and grading of seminar papers: 0
Review and grading of the project: 0
Test: 0
Test: 10
Final exam: 5

Activity during lectures: 0
Test/test: 30
Laboratory practice: 0
Calculation tasks: 0
Seminar paper: 0
Project: 0
Final exam: 70
Requirement for taking the exam (required number of points): 0

М. Живковић, Алгоритми, Математички факултет, Београд, 2000.; T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, The MIT Press, Cambridge, 2009.; Ф. Марић, В. Маринковић, М. Николић, Алгоритми и структуре података, скрипта.