FPF:UIMOIBP035 Algorithms and Programming II - Course Information
UIMOIBP035 Algorithms and Programming II
Faculty of Philosophy and Science in OpavaSummer 2024
- Extent and Intensity
- 2/2/0. 5 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
RNDr. Jiří Martinů, Ph.D. (seminar tutor)
Mgr. Jan Schreier (seminar tutor) - Guaranteed by
- doc. RNDr. Lucie Ciencialová, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Timetable
- Tue 18:05–19:40 B4
- Timetable of Seminar Groups:
UIMOIBP035/B: Tue 14:45–16:20 B3a, J. Martinů - Prerequisites
- Algorithms and Programming I
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Information and communication technologies (programme FPF, MOI)
- Course objectives
- The course "Algorithms and programming II" ensues the course "Algorithms and programming I". Students will get familiar with dynamic variables and dynamic data structures issue, the application of dynamic data structures in the graph, sorting and searching algorithms.
- Learning outcomes
- Students will be able to:
- use the dynamic variables
- create dynamic data structures like a queue, stack, linked lists
- implement these data structures in the sorting and graph algorithms - Syllabus
- 1. Dynamic memory allocation, dynamic variables
- 2. Abstract data types
- 3. Meaning of private, public, static, friend, template
- 4. Linked lists - creating, inserting, removing elements
- 5. Sorting algorithms in linked lists
- 6. Search algorithms in linked lists
- 7. Graph implementation and graph algorithms
- Literature
- required literature
- http://www.algoritmy.net. URL info
- Prokop, J. Algoritmy v jazyku C a C++. Praha. ISBN 24797465. 2015. info
- SEDGEWICK, R., WAYNE, K. Algorithms. Boston: Addison-Wesley Professional. ISBN 978-0321573513. 2011. info
- recommended literature
- MATOUŠEK, David. C++ bez předchozích znalostí. Brno: Computer press. ISBN 978-80-251-4640-8. 2016. info
- Stephen Prata. Mistrovství v C++ 4. aktualizované vydání. ISBN 9788025138281. 2013. info
- CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., STEIN, C. Introduction to Algorithms. Cambridge: The MIT Press. ISBN 978-0262033848. 2009. info
- Teaching methods
- Interactive lecture, tutorial
- Assessment methods
- Credit: Mandatory attendance at tutorials at least 75%. Final project.
Exam: Programming and defending the application according to the drawn assignment. - Language of instruction
- Czech
- Further Comments
- Study Materials
- Enrolment Statistics (recent)
- Permalink: https://is.slu.cz/course/fpf/summer2024/UIMOIBP035