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
2021/2022
Semester/trimester when the component is delivered
5 Semester
Number of ECTS credits allocated
3
Learning outcomes
PLO18.1. Know and apply methods of algorithm development, software design and data structures and knowledge.
Form of study
Prerequisites and co-requisites
To successfully learn the discipline «Construction and analysis of algorithms» the student's academic level must meet the following requirements: tо know: basic concepts of programming and principles of software development, types of data structures; be able to: apply basic concepts and methods of function evaluation and solve problems using fundamental algorithms; to possess: basic skills of scheduling tasks into components and programming.
Course content
Study of basic fundamental and advanced algorithms for their further application in solving algorithmic problems, mastering the basic methods of algorithm analysis, acquiring the ability to build, analyze and make rational choice of algorithm for a specific task from known classes of algorithms. The discipline belongs to the list of elective academic disciplines. The course is taught in 5th semester. It includes 2 semantic parts and 2 tests. Discipline ends with credit.
Recommended or required reading and other learning resources/tools
1. Kormen T. Algoritmy. Postroenie i analiz. 3-e izd. / T. Kormen, Ch. Lejzerson, R. Rivest, K. Shtajn. – M. : ID "Vil'yams", 2013. – 1328 s. 2. Vergunova І.M. Pobudova ta analіz algoritmіv. Lekcії. – Vіnnicya: TVORI, 2020. –164 s. 3. Sedzhvik R. Algoritmy na C++. Fundamental'nye algoritmy i struktury dannyh / R. Sedzhvik. – M. : ID "Vil'yams", 2011. – 1056 s. : il. 4. Knut D. Iskusstvo programmirovaniya, tom 3. Sortirovka i poisk. 3-e izd. – M.: Vil'yams, 2006. – S. 822. 5. Klejnberg. Dzh. Algoritmy: razrabotka i primenenie / Dzh. Klejnberg, E. Tardos. – SPb.: Piter, 2016. – 800 s. 6. Levitin A. Algoritmy. Vvedenie v razrabotku i analiz / A. Levitin. – M.: Vil'yams, 2006. – 576 s. 7. Sedzhvik R. Fundamental'nye algoritmy na S++. T 1-4. Analiz/Struktury dannyh/Sortirovka/Poisk./ R. Sedzhvik. – SPb.: OOO "DiaSoftYuP", 2002. – 688 s.
Planned learning activities and teaching methods
Lectures, individual work.
Assessment methods and criteria
Assessment during the semester: Maximum number of points that can be obtained by a student: 100 points: Test 1 from the first topic - 40/24 points. Test 2 from the second topic - 40/24 points. The current score is 20/12 points. The credits is based on the results of the student's work throughout the semester and does not provide additional assessment activities for successful students.
Language of instruction
Ukrainian language

Lecturers

This discipline is taught by the following teachers

Departments

The following departments are involved in teaching the above discipline