Completed courses Programming 1 and Programming 2.
Data structures and algorithms 1
The basics of algorithm analysis
Basic data structures. Stack, queue, linked list. Trees, graphs.
Basic methods of algorithms development with examples. Divide and conquer. Greedy method. Dynamic programming.
- T. H. Cormen ... [et al.]: Introduction to Algorithms, 2nd ed., Cambridge (Mass.) : MIT Press ; Boston : McGraw-Hill, cop. 200
- I. Kononenko, M. Robnik-Šikonja: Algoritmi in podatkovne strukture 1, Ljubljana : Fakulteta za računalništvo in informatiko, 2003.
- I. Kononenko, M. Robnik-Šikonja: Algoritmi in podatkovne strukture 2, Ljubljana : Fakulteta za računalništvo in informatiko, 2004.
- 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.
Students will learn the basic data structures and typcal related algorithms. They will be able to use newly learnt data structures and algorithms solving mathematical problems and real life problems.
Knowledge and understanding:
The student learns some of the fundamentals of data structures and algorithms, as well as practical problems where they can be applied.
Application:
The student develops the ability to design effective computer programs and the ability 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 2.
Lectures, exercises, homeworks, consultations
Homeworks (prerequisite for written exam), exam from the exercises (colloquiums or written exam).
Seminar paper, oral exam - defense of the seminar paper
Students receive two grades: one from the written exam and home works and the other from the oral exam.
5 - 10, a student passes the exam if he is graded from 6 to 10
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]