Skip to main content

Data structures and algorithms 2

2026/2027
Programme:
Applied mathematics
Year:
3 year
Semester:
second
Kind:
optional
ECTS:
5
Language:
slovenian
Hours per week – 2. semester:
Lectures
2
Seminar
0
Tutorial
2
Lab
0
Prerequisites

Completed courses Programming 1, Programming 2 and Computer science 1  / Data structures and algorithms 1.

Content (Syllabus outline)

Complex data structures. Priority queue. Heap. Balanced trees. Hashing. Search trees. B-trees. Branch and bound method. P/NP problem.

Readings
  1. T. H. Cormen ... [et al.]: Introduction to Algorithms, 2nd ed. - Cambridge (Mass.) : MIT Press ; Boston : McGraw-Hill, cop. 200
  2. I. Kononenko, M. Robnik-Šikonja: Algoritmi in podatkovne strukture 1, Ljubljana : Fakulteta za računalništvo in informatiko, 2003.
  3. I. Kononenko, M. Robnik-Šikonja: Algoritmi in podatkovne strukture 2, Ljubljana : Fakulteta za računalništvo in informatiko, 2004.
  4. J. Kozak: Podatkovne strukture in algoritmi, Ljubljana : Društvo matematikov, fizikov in astronomov SRS, 1986, 1997.

Spletne strani in tečaji (Coursera, Udacity, Edx ...) s tega področja, izbor je vsakoletno osvežen na spletni strani predmeta.

Zapiski s predavanj, gradivo za vaje in ostalo gradivo v spletni učilnici predmeta.

Web sites and courses (Coursera, Udacity, Edx ...), selection is annually refreshed on the Web site of the subject.

Notes from lectures, tutorials and other resources in the online classroom.

Objectives and competences

Students will study additional data structures and algorithms. Independently they will study a new data structure or algorithm and prepare its presentation. They will be able to use the data structures or algorithms addressing the specific problems.

Intended learning outcomes

Knowledge and understanding:
The student develops the ability to independently studies a new data structure and algorithm. He is able to prepare a report on algorithmic solution of a certain problem.
Application:
The student is able to design effective computer programs and to predict their behavior.
Reflection:
The student develops the ability of integration of theoretical and practical procedures in the development of algorithms
Transferable skills:
The subject is connected with Computing Science 1.

Learning and teaching methods

Lectures, exercises, usage of distance learning techniques, home works, consultations

Assessment

Students receive one grade from the project.
preparation of the project
presentation
priprava poročila z zagovorom
5 - 10, a student passes the exam if he is graded from 6 to 10

Lecturer's references

Sergio Cabello Justo:
– BERG, Mark de, CABELLO, Sergio, HAR-PELED, Sariel. Covering many or few points with unit disks. Theory of computing systems, ISSN 1432-4350, 2009, vol. 45, no. 3, str. 446-469 [COBISS-SI-ID 14900825]
– CABELLO, Sergio. Many distances in planar graphs. Algorithmica, ISSN 0178-4617, 2012, vol. 62, no. 1-2, str. 361-381 [COBISS-SI-ID 15702873]
– CABELLO, Sergio, CHAMBERS, Erin W., ERICKSON, Jeff. Multiple-source shortest paths in embedded graphs. SIAM journal on computing, ISSN 0097-5397, 2013, vol. 42, no. 4, str. 1542-1571 [COBISS-SI-ID 16668761]