FPF:UIN1003 Algorithms and Programming II - Course Information
UIN1003 Algorithms and Programming II
Faculty of Philosophy and Science in OpavaSummer 2021
- Extent and Intensity
- 2/2/0. 6 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. František Koliba, CSc. (lecturer)
RNDr. Miroslav Langer, Ph.D. (lecturer)
Mgr. Pavel Martínek (seminar tutor)
Mgr. Tomáš Filip (seminar tutor) - Guaranteed by
- doc. RNDr. František Koliba, CSc.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Prerequisites
- Successful pass out the course 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
- Applied Computer Science (programme FPF, B1802 AplI)
- Applied Mathematics (programme MU, B1101)
- Applied Mathematics in Risk Management (programme MU, B1101)
- Information studies with the focus on library science (programme FPF, B7201 InSK)
- Computer Science and Technology (programme FPF, B1801 Inf)
- Mathematical Methods in Economics (programme MU, B1101)
- Mathematics (programme MU, B1101)
- Course objectives
- The course "Algorithms and programming II" follows up the course "Algorithms and programming I". Students get familiar with dynamic variables and dymamic data structures issue, application of dymamic data structures in graph, sorting and searching algorithms.
- Syllabus
- 1. Dynamic variables
2. Dynamic data structures, queue, stack, list
3. Aplication of dynamic data structures
4. Searching linked list
5. Radix sort
6. Breadth first search and depth first search
7. Passing a maze
8. Hamiltonian path and cycle
9. Rod Cutting Problem
10. Handling the files
- 1. Dynamic variables
- Literature
- required literature
- CORMEN, Thomas H., LEISERSON, Charles E., RIVEST, Ronald L, STEI. Introduction to Algorithms. The MIT Press,, 2009. ISBN 978-0262033848. info
- WIRTH, N. Algoritmy a štruktúry údajov. ALFA, Bratislava,, 1990. ISBN 80-05-00153-3. info
- recommended literature
- http://www.algoritmy.net. URL info
- msdn.microsoft.com. URL info
- www.itnetwork.cz. URL info
- Prokop, J. Algoritmy v jazyku C a C++. Praha, 2015. ISBN 24797465. info
- PINK, Hensley. Learning Pascal Programming: The Beginner's Guide. Amazon Digital Services, 2012. ISBN ASIN:B007HEXQ1M. info
- SEDGEWICK, Robert, WAYNE, K. Algorithms. Addison-Wesley Professional, 2011. ISBN ASIN:B004P8J1NA. info
- TOPFER, P. Algoritmy a programování. Praha, Prometheus, 2002. ISBN 80-85849-83-6. info
- Prata, S. Mistrovství v C++. Praha, 2001. info
- Buchalcová, A. Algoritmizace a programování. Praha, 1990. info
- JINOCH, J. , MÜLLER, K. ,VOGEL, J. Programování v jazyku Pascal. SNTL, Praha, 1988. info
- Teaching methods
- Interactive lecture
Lecture with a video analysis - Assessment methods
- Exam
Credit - Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
The course can also be completed outside the examination period. - Teacher's information
- 1. Active participation in seminar
2. Programm final project.
- Enrolment Statistics (Summer 2021, recent)
- Permalink: https://is.slu.cz/course/fpf/summer2021/UIN1003