Complexity of algorithms

Course: Informatics

Structural unit: Faculty of Computer Science and Cybernetics

Title
Complexity of algorithms
Code
ВК.1.06
Module type
Обов’язкова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2021/2022
Semester/trimester when the component is delivered
7 Semester
Number of ECTS credits allocated
4
Learning outcomes
LO18.1. Know and apply methods of algorithm development, software design and data and knowledge structures.
Form of study
Distance form
Prerequisites and co-requisites
Have knowledge of modern programming languages, tools for developing and designing programs for solving scientific and applied problems and learning skills.
Course content
Метою дисципліни є набуття теоретичних та практичних знань в одній з найактуальніших на сьогодні галузей інформаційних технологій: аналіз алгоритмів та визначення їх складності. У ході навчання студенти ознайомляться з основними моделями для аналізу алгоритмів та визначенню їх складності.
Recommended or required reading and other learning resources/tools
Planned learning activities and teaching methods
Lectures, independent work.
Assessment methods and criteria
Semester assessment: 1. Test 1 - 40 points / 24 points 2. Test 2 - 35 points / 21 points; 3. Homework - 25 points / 15 points Credit points are defined as the sum of grades / points for all successfully assessed learning outcomes provided by this program; Scores below the minimum threshold are not added; The minimum threshold for the total score for all components is 60% of the maximum possible number of points.
Language of instruction
Ukrainian language

Lecturers

This discipline is taught by the following teachers

Oleksii M Fedorus
Mathematical Informatics
Faculty of Computer Science and Cybernetics

Departments

The following departments are involved in teaching the above discipline

Mathematical Informatics
Faculty of Computer Science and Cybernetics