FPF:UIKKB13 Algorithms and Programming II - Course Information

UIKKB13 Algorithms and Programming II

Extent and Intensity

0/0. 6 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

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.

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

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
• Prata, S. Mistrovství v C++. Praha, 2001. info
• Buchalcová, A. Algoritmizace a programování. Praha, 1990. 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)

The course can also be completed outside the examination period.
Information on the extent and intensity of the course: Přednáška 6 HOD/SEM, Seminář 6 HOD/SEM.

Teacher's information

1. Active participation in seminar
2. Programm final project.

• Enrolment Statistics (Summer 2019, recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2019/UIKKB13