Construction and analysis of algorithms

Course: Informatics

Structural unit: Faculty of Computer Science and Cybernetics

Title
Construction and analysis of algorithms
Code
К.1.02
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
3
Learning outcomes
PLO 18.1. Know and apply methods of developing algorithms, designing software and data and knowledge structures.
Form of study
Prerequisites and co-requisites
1. Know: basic concepts of programming and principles of program development, types of data structures. 2. Be able to: apply basic concepts and methods of evaluating functions and solve problems using fundamental algorithms. 3. Possess elementary skills: dividing tasks into components, programming.
Course content
The educational discipline "Construction and analysis of algorithms" is a component of the educational and professional training program for specialists at the first (bachelor's) level of higher education in the field of knowledge 12 "Information technologies" from the specialty 122 "Computer science", the educational and professional program "Informatics". This subject is a mandatory study subject of the "Informatics" program. It is taught in the 5th semester of the 3rd year in the amount of 90 hours. (3 ECTS credits) in particular: lectures – 42 hours, consultations – 2 hours, independent work – 46 hours. The course includes 2 parts and 2 tests. The discipline ends with a credit in the 6th semester.
Recommended or required reading and other learning resources/tools
Main: 1. Kormen T. Algoritmy. Postroenie i analiz. 3-e izd. / T. Kormen, Ch. Leizerson, R. Rivest, K. Shtain. – M. : ID "Vil-iams", 2013. – 1328 s. 2. Knut D. Iskusstvo programmirovaniia, tom 3. Sortirovka i poisk. 3-e izd. – M.: Vil-iams, 2006. – S. 822. 3. Sedzhvik R. Algoritmy na C++. Fundamental-nye algoritmy i struktury dannykh / R. Sedzhvik. – M. : ID "Vil-iams", 2011. – 1056 s. : il. 4. Kleinberg. Dzh. Algoritmy: razrabotka i primenenie / Dzh. Kleinberg, E. Tardos. – SPb.: Piter, 2016. – 800 s. 5. Levitin A. Algoritmy. Vvedenie v razrabotku i analiz / A. Levitin. – M.: Vil-iams, 2006. – 576 s. 6. Vergunova І.M. Pobudova ta analіz algoritmіv. Lektsії. – Vіnnitsia:TVORI, 2020. – 164 s. ..
Planned learning activities and teaching methods
Lectures, consultations, independent work
Assessment methods and criteria
- semester assessment: 1. Control work 1: RN 1.1, RN 1.3, RN 2.1, RN 3.1, RN 4.2 — 40 points/24 points. 2. Control work 2: РН1.2, РН 1.3, Р.Н 2.1, Р.Н 3.1, РН 4.2 - 40 points/24 points. 2. Completion of tasks set for independent work (homework): RN1.1, RN1.2, RN1.3, RN2.1, RN3.1, RN4.1, RN4.2 – 20 points / 12 points. - final assessment: credit. The credit is given based on the results of the student's work throughout the entire semester and does not include additional evaluation measures for successful students.
Language of instruction
Ukrainian

Lecturers

This discipline is taught by the following teachers

Departments

The following departments are involved in teaching the above discipline