FPF:UIINK08 Algorithms and Programming II - Course Information

UIINK08 Algorithms and Programming II

Extent and Intensity

14/0/0. 5 credit(s). Type of Completion: zk (examination).

Teacher(s)

RNDr. Jiří Martinů, Ph.D. (lecturer)
doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
RNDr. Jiří Martinů, Ph.D. (seminar tutor)

Guaranteed by

doc. RNDr. Lucie Ciencialová, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava

Prerequisites

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" 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.-2. Dynamic memory allocation, dynamic variables
• 3. Abstract data types
• 4.-5. Usage of private, public, static, friend, template
• 6.-8. Linked lists - creating, inserting, removing elements
• 9.-10. Sorting algorithms in linked lists
• 11. Search algorithms in linked lists
• 12.-13. Graph implementation and graph algorithms

Teaching methods

Interactive lecture, tutorial

Assessment methods

Credit: Final project, defending the final project. Mandatory attendance at tutorials at least 75%.
Exam: Program and defend an application according to the drawn assignment.

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 14 HOD/SEM.

• Enrolment Statistics (Summer 2025, recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2025/UIINK08