UIINK08 Algorithms and Programming II

Faculty of Philosophy and Science in Opava
Summer 2020
Extent and Intensity
14/0/0. 5 credit(s). Type of Completion: zk (examination).
Teacher(s)
RNDr. Miroslav Langer, Ph.D. (lecturer)
Guaranteed by
RNDr. Miroslav Langer, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava
Prerequisites
TYP_STUDIA(B)&& UIINK02 Algorithms and programming I
Successful pass out the course Algorithms and Programming I.
Course Enrolment Limitations
The course is offered to students of any study field.
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.
Learning outcomes
Students will be able to:
- design and explain algorithms to solve problems corresponding to the topics of the course
- program an application performing these 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
Literature
    required literature
  • http://www.algoritmy.net. URL info
  • Prokop, J. Algoritmy v jazyku C a C++. Praha, 2015. ISBN 24797465. info
    recommended literature
  • http://msdn.microsoft.com, http://www.cplusplus.com, http://www.itnetwork.cz, https://stackoverflow.com
  • MATOUŠEK, David. C++ bez předchozích znalostí. Brno: Computer press, 2016. ISBN 978-80-251-4640-8. info
  • Stephen Prata. Mistrovství v C++ 4. aktualizované vydání. 2013. ISBN 9788025138281. info
  • CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., STEIN, C. Introduction to Algorithms. Cambridge: The MIT Press, 2009. ISBN 978-0262033848. info
    not specified
  • SEDGEWICK, R., WAYNE, K. Algorithms. Boston: Addison-Wesley Professional, 2011. ISBN 978-0321573513. info
Teaching methods
Interactive lecture
Tutorials
Assessment methods
1. Active participation in seminars, participation min. 75%
2. Credit project
3. Exam: programming and defense of own application
Language of instruction
Czech
Further comments (probably available only in Czech)
Study Materials
The course can also be completed outside the examination period.
Information on the extent and intensity of the course: Přednáška 14 HOD/SEM.
The course is also listed under the following terms Summer 2021, Summer 2022, Summer 2023, Summer 2024, Summer 2025.
  • Enrolment Statistics (Summer 2020, recent)
  • Permalink: https://is.slu.cz/course/fpf/summer2020/UIINK08