Data Structures and Algorithms II

Basic Information

I054 (3+2+0) - 7 ECTS credits

The main course objective is to introduce advanced data structures and graph algorithms with their applications to the solving of a wide spectrum of different computational problems. At the end of the course, students are introduced to selected topics on algorithms in number theory and computational geometry. An efficient implementation of data structures and algorithms, by using some programming language, is also one of the most important objectives.

You can access the course content at the following link: PDF

Teachers

Instructor: Dr. Domagoj Ševerdija, Assistant Professor

Basic literature

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, 3Ed, MIT Press, 2009.

Additional literature

M. T. Goodrich, R. Tamassia, D. M. Mount, Data Structures and Algorithms in C++, Wiley, 2010.
A. Drozdek, Data Structures and Algorithms in C++, Cengage Learning, 2012.
R. Sedgewick, K. Wayne, Algorithms, Addison-Wesley Professional, 2011.

Teaching materials

The materials are available on the internal Teams channel of the course, through which all internal communication takes place. Students are required to register on the course’s Teams channel. The channel code for joining the course can be found in the schedule.