FPF:UIINP08 Algorithms and Programming II - Course Information

UIINP08 Algorithms and Programming II

Extent and Intensity

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

Teacher(s)

doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
Ing. Jiří Blahuta, Ph.D. (lecturer)
RNDr. Jiří Martinů, Ph.D. (seminar tutor)
Mgr. Jan Schreier (seminar tutor)

Guaranteed by

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

Timetable

Tue 18:05–19:40 B4

• Timetable of Seminar Groups:

UIINP08/A: Mon 16:25–18:00 B3a, J. Schreier
UIINP08/B: Tue 14:45–16:20 B3a, J. Martinů

Prerequisites

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

• Informatics B/P (programme FPF, INFOR-bpk)
• Mathematical Methods and Modelling (programme MU, Bc-M)
• Mathematical Methods in Economics (programme MU, Bc-M)
• Mathematical Methods in Risk Management (programme MU, Bc-M)
• General Mathematics (programme MU, Bc-M)

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

Study Materials
The course can also be completed outside the examination period.

• Enrolment Statistics (recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2024/UIINP08