|
ECTS:
|
6
|
Lecturers in charge:
|
Prof. dr. sc.
Vedran Mornar
|
English level:
1,1,1
|
All teaching activities in the course will be held on English. This level includes courses with multiple groups (i.e., all teaching will be held strictly in Croatian for Croatian groups, and strictly in English for English groups).
|
Description:
|
Algorithms and complexity. Generic programming. Standard template library. Containers. Binary trees: deletion, balancing, B-trees. Radix sorting and searching. External searching. String algorithms. Fundamentals of data compression. Fundamentals of cryptography. Geometric algorithms: convex hull, range searching, geometric intersection, closest point. Graph algorithms: searching, connectivity, minimum spanning tree, shortest path, network flow.
|
Literature:
|
- Robert Sedgewick: Algorithms in C++, Addison-Wesley, 1992.
- Mark Allen Weiss: Data structures and algorithm analysis in C, Addison-Wesley, 1997.
- Adam Drozdek: Data Structures and Algorithms in C++, Course Technology, 2004.
|
|
Ljetni semester
|
course for
Graduation study
|
|
