Data structures and algorithms

Course: Informatics

Structural unit: Faculty of Computer Science and Cybernetics

Title
Data structures and algorithms
Code
ВК.3.03
Module type
Вибіркова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2023/2024
Semester/trimester when the component is delivered
6 Semester
Number of ECTS credits allocated
4
Learning outcomes
PLO 18.3. Know the mathematical apparatus and principles of programming and be able to apply them in the creation of software systems. PLO 20.3. Know the algorithms of information analysis and be able to apply them in solving practical problems.
Form of study
Prerequisites and co-requisites
1. To know programming paradigms, discrete mathematics, mathematical logic, theory of algorithms and the basics of programming in the scope of standard university courses. 2. To be able to apply knowledge from the above disciplines to solving problems. 3. To have basic skills of using logico-mathematical symbols and basics of programming.
Course content
The educational discipline "Data Structures and Algorithms" examines basic data structures and basic computational algorithms, allows you to acquire practical skills in the design, development and analysis of algorithms in solving applied problems and in software development. The acquired knowledge makes it possible to effectively apply in practice methods and algorithms for solving educational and practical problems, justify one's own view on solving a problem, communicate with colleagues on programming issues, and prepare reports on solving problems. It is taught in the 6th semester of the 3rd year in the amount of 120 hours. (4 ECTS credits), in particular: lectures – 42 hours, consultations – 2 hours, independent work – 76 hours.
Recommended or required reading and other learning resources/tools
Basic: 1. Akho A. Struktury dannykh i algoritmy. / A. Akho, D. Kholkroft, D. Ul-man. – M.: Vil-iams, 2000. 2. Kormen T. Algoritmy: postroenie i analiz / T. Kormen, Ch. Leizerson, R. Rivest, K. Shtain. – M. : Vil-iams, 2013. 3. Knut D. Iskusstvo programmirovaniia dlia EVM. Toma 1-3. / D. Knut. – M. Vil-iams, 2000. 4. Sedzhvik R. Fundamental-nye algoritmy na S. Chasti 1-5. / R. Sedzhvik – M.: Diasoft, 2003. 5. Stivens R. Algoritmy. Teoriia i prakticheskoe primenenie./ R. Stivens. – M.: Iz-vo "E", 2016. 6. Uorren G.S. Algoritmicheskie triuki dlia programmistov. / G.S. Uorren. – M.:Vil-iams, 2014. ..
Planned learning activities and teaching methods
Lectures, consultations, independent work
Assessment methods and criteria
- semester assessment: 1. Control work 1: РН1.1, РН1.2, РН2.1, РН3.1 – 30 points/18 points. 2. Control work 2: РН1.1, РН1.2, РН2.1, РН4.2 – 30 points/18 points. A typical test paper 1 consists of theoretical and practical tasks (with open and closed answers) based on the material of chapter 1.
Language of instruction
Ukrainian

Lecturers

This discipline is taught by the following teachers

Departments

The following departments are involved in teaching the above discipline