Infopaket

Algorithms and Complexity

ННД.28

Обов’язкова дисципліна для ОП

First

2022/2023

4 Semester

4

PLO01. Analyze, purposefully search for and select the necessary information and reference resources and knowledge to solve professional problems, taking into account modern advances in science and technology. PLO05. Know and apply relevant mathematical concepts, methods of domain, system and object-oriented analysis and mathematical modeling for software development. PLO06. Ability to select and use the software development methodology that is appropriate for a given task. PLO13. Know and apply methods of algorithm development, software design and data and knowledge structures design.

Full-time form

1. Know: basics of algebra, mathematical analysis, discrete mathematics. 2. Have skills in programming in a high-level programming language.

The aim of the discipline is to acquaint students with main data structures and algorithms in programming. As a result, the student must: know main data structures and algorithms used in programming and their efficiency; be able to analyze algorithms complexity, choose and implement optimal algorithms and data structures in accordance with the task, design new algorithms using well-known techniques if needed and estimate the complexity.

Lectures, laboratory classes, individual work, tests, defense of laboratory work, exam.

Semester 3 assessment: -Test 1, 2: LO1.1-1.2, LO2.1 – 30/18p., 20/12p. -Laboratory work: LO2.1-2.2, LO3.1, LO4.1-4.2 – 20/12p. -Final assessment (credit): credit points are defined as the sum of points for all successfully assessed learning outcomes. Semester 4 assessment: -Test 1, 2: LO1.1-1.2, LO2.1 – 20/12p., 10/6p. -Laboratory work: LO2.1-2.2, LO3.1, LO4.1-4.2 – 30/18p. -Final assessment (exam): maximum number of points: 40; learning outcomes that are evaluated: LO1.1-1.2, LO2.1-2.2.

Ukrainian