FPF:UIMOIBK035 Algorithms and Programming II - Course Information

UIMOIBK035 Algorithms and Programming II

Extent and Intensity

0/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)
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
- handle the directories and files

Syllabus

• 1. Dynamic variables
• 2. Dynamic data structures, queue, stack, list
• 3. Application 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

Teaching methods

Interactive lecture, tutorial

Assessment methods

Credit: Final project, defending the final project.
Exam: Program and defend an application according to the drawn assignment.

Language of instruction

Czech

Further comments (probably available only in Czech)

Study Materials
Information on the extent and intensity of the course: 14 hod/sem.

• Enrolment Statistics (Summer 2021, recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2021/UIMOIBK035