Data structures and algorithms 1

Completed courses Programming 1 and Programming 2.

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.

J. Erickson, Algorithms, http://jeffe.cs.illinois.edu/teaching/algorithms/
T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms, 2. izdaja, MIT Press, Cambridge, 2001.
I. Kononenko, M. Robnik Šikonja: Algoritmi in podatkovne strukture I, 1. izdaja, Fakulteta za računalništvo in informatiko, Ljubljana, 2003.
I. Kononenko, M. Robnik Šikonja: Algoritmi in podatkovne strukture II, 1. izdaja, Fakulteta za računalništvo in informatiko, Ljubljana, 2004.
J. Kozak: Podatkovne strukture in algoritmi, DMFA založništvo, Ljubljana, 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.
grading: 5 (fail), 6-10 (pass) (according to the Statute of UL)

Sergio Cabello:
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]
CABELLO, Sergio. Many distances in planar graphs. Algorithmica, ISSN 0178-4617, 2012, vol. 62, no. 1-2, str. 361-381. [COBISS-SI-ID 15702873]
Sergio Cabello:
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]
Matija Lokar:
NANČOVSKA ŠERBEC, Irena, CERAR, Špela, LOKAR, Matija, BRODNIK, Andrej. Elective subject computer science in primary school – the teachers' opinions. V: Informatics in primary education : approaches, current issues and lessons learnt : [talks and abstracts]. Fairbanks: University of Alaska Fairbanks, 2022. Str. 12. https://www.ifip-tc3.org/working-groups/working-group-3-1/symposia/. [COBISS-SI-ID 121128707]
BRODNIK, Andrej, KRAJNC, Radovan, KREUH, Nives, FÜRST, Luka, ČREPINŠEK, Matej, PESEK, Igor, ČOTAR KONRAD, Sonja, MAJKUS, Davorin, KERMC, Nataša, ANŽELJ, Gregor, OCEPEK, Uroš, LAMPE, Andreja, KRAJNC, Vili, ČAMPELJ, Borut, DEMŠAR, Janez, LOKAR, Matija, NANČOVSKA ŠERBEC, Irena. Okvir računalništva in informatike od vrtca do srednje šole : poročilo strokovne delovne skupine za analizo prisotnosti vsebin računalništva in informatike v programih osnovnih in srednjih šol ter za pripravo študije o možnih spremembah (RINOS). Ljubljana: Ministrstvo za izobraževanje, znanost in šport, 2022. 1 spletni vir (1 datoteka PDF (23 str.)), ilustr., tabele. https://redmine.lusy.fri.uni-lj.si/attachments/download/3060/Porocilo_RINOS_10_1_22.pdf. [COBISS-SI-ID 122530051]
CERAR, Špela, LOKAR, Matija, ANŽELJ, Gregor, BRODNIK, Andrej, NANČOVSKA ŠERBEC, Irena. Textbooks and materials for teaching computer science in Slovenia. V: BOLLIN, Andreas (ur.), FUTSCHEK, Gerald (ur.). Informatics in schools : a step beyond digital education : 15th International Conference on Informatics in Schools: Situation, Evolution, and Perspectives, ISSEP 2022, Vienna, Austria, September 26-28, 2022 : proceedings. Cham: Springer, cop. 2022. Str. 138-149, ilustr., graf. prikaza. Lecture Notes in Computer Science, 13488. ISBN 978-3-031-15850-6. ISSN 0302-9743. [COBISS-SI-ID 128020483]
LOKAR, Matija. Pišek - Programming with Blocks Competition : a new Slovenian Programming Competition. V: KORI, Külli (ur.), LAANPERE, Mart (ur.). Proceedings of the International Conference on Informatics in School: Situation, Evaluation and Perspectives, Tallinn, Estonia, November 16-18, 2020. Aachen: R. Piskac c/o Redaktion Sun SITE, Informatik V, RWTH Aachen, cop. 2020. 1 spletni vir (1 datoteka pdf (12 str.)). CEUR workshop proceedings, Vol. 2755. ISSN 1613-0073. http://ceur-ws.org/Vol-2755/paper1.pdf. [COBISS-SI-ID 41153539]
BRODNIK, Andrej, LOKAR, Matija. Empowering the teachers with the NAPOJ - a grassroots movement towards computing teachers community of practice. V: POZDNIAKOV, Sergei N. (ur.), DAGIENE, Valentina (ur.). Informatics in schools : new ideas in school informatics : proceedings. Cham: Springer, cop. 2019. Str. 3-14, ilustr. Lecture notes in computer science (Internet), 11913, SL1, Theoretical computer science and general issues. ISBN 978-3-030-33759-9, ISBN 3-030-33759-6. ISSN 1611-3349. https://link.springer.com/chapter/10.1007/978-3-030-33759-9_1, DOI: 10.1007/978-3-030-33759-9_1. [COBISS-SI-ID 1538472643]