1. komponenta

Lecture type	Total
Exercises	30
Lectures	30

* Load is given in academic hour (1 academic hour = 45 minutes)

The course covers the characteristics of standard data structures (list, stack, queue, binary tree), as well as algorithms for working with these data structures in the C++ programming language.

1. Construct a solution using hierarchical data structures (tree, heap, priority queue) and the corresponding algorithms.
2. Construct a solution using a tree-based dictionary and the corresponding algorithms.
3. Create a solution using addressing techniques and justify their time complexity.
4. Describe sorting algorithms and construct solutions based on sorting algorithms.
5. Describe search algorithms and construct solutions based on search algorithms.
6. Determine and justify the a priori and a posteriori time complexity for a given algorithm implemented in a programming language.
7. Construct a solution using linear data structures (array, linked list, stack, queue) and the corresponding algorithms.

1. Strukture podataka i algoritmi, Knjiga omogućuje stjecanje znanja o apstraktnim tipovima podataka te o strukturama podataka koje služe za njihovu implementaciju. Daljnji cilj je stjecanje znanja o osnovnim tehnikama za oblikovanje i analizu algoritama., R. Manger, Element d.o.o., 2015.

Examination :
Passed : Basics of programming

Mandatory course - Regular studij - Computing