Computing theory, algorithms and data structures (122 Computer Science)
Type: Normative
Department: radiophysics and computer technologies
Curriculum
| Semester | Credits | Reporting |
| 3 | 4 | Exam |
Lectures
| Semester | Amount of hours | Lecturer | Group(s) |
| 3 | 32 | Associate Professor Velhosh S. R. | ФеІ-21, ФеІ-22, ФеІ-23, ФеІ-24 |
Laboratory works
| Semester | Amount of hours | Group | Teacher(s) |
| 3 | 32 | ФеІ-21 | Senior Researcher Serednytska K. I., Senior Researcher Serednytska K. I. |
| ФеІ-22 | Associate Professor Velhosh S. R., Associate Professor Velhosh S. R. | ||
| ФеІ-23 | Senior Researcher Serednytska K. I., Associate Professor Sas Nataliya | ||
| ФеІ-24 | Associate Professor Sas Nataliya, Associate Professor Sas Nataliya |
Опис навчальної дисципліни
The purpose of teaching the discipline “Algorithm Theory” is to teach students to effectively solve algorithmic problems, to master the fundamental ideas and methods of algorithm theory, to develop a systematic approach to solving algorithmic problems, to master basic information data structures.
The task of the discipline “Algorithm Theory” is to acquaint students with the basic concepts and problems, as well as mastering the fundamental concepts of algorithm for computer science, the formation of practical skills in developing algorithms for solving applications and programming.
After studying the discipline, students must:
know:
basic concepts of algorithm theory, formal models of algorithms, primitively recursive, general-recursive and partial-recursive functions, issues of computability, solvability and unsolvability of mass problems, concepts of temporal and spatial complexity of algorithms in solving computational problems.
be able:
use formal models of algorithms and computational functions, establish the solvability, partial solvability and unsolvability of algorithmic problems, design, develop and analyze algorithms, evaluate their efficiency and complexity.
Recommended Literature
Базова
- Клакович Л. М. Теорія алгоритмів : навчальний посібник. / Л. М. Клакович, С. М. Левицька, О. В. Костів. – Львів: ЛНУ, 2008. – 140 с.
- H. Cormen, Ch. E. Leiserson, R. L. Rivest, C. Stein. Introduction to Algorithms. Third Edition. – The MITPress Cambridge, Massachusetts London, England.
- V. Aho, J. E. Hopcroft, J. D. Ullman. Data structure and Algorithms. – Addison-Wesley.
- Sedgewick. Algorithms in C++. Fundamentals Data Structures, Sorting, Searching, Graph Algorithms. – Addison-Wesley.
- Sedgewick, K. Wayne. Algorithms. Fourth Editions. – Addison-Wesley.
- Креневич А. П. Алгоритми і структури даних : підручник. / А. П. Креневич. – К. : ВПЦ „Київський університет”, 2021. – 200 с.
- Глибовець М.М. Основи комп’ютерних алгоритмів. – К.: Вид. дім „КМ академія”, 2003. – 452 с.
Допоміжна література.
- E. Knuth. The Art of Computer Programming. Third Editions. – Vol. 1. Fundamentals Algorithms. – Addison-Wesley.
- E. Knuth. The Art of Computer Programming. Third Editions. – Vol. 2. Seminumerical Algorithms. – Addison-Wesley.
- E. Knuth. The Art of Computer Programming. Third Editions. – Vol. 3. Sorting and Searching. – Addison-Wesley.
- J. McConnell. Analysis of Algorithms : An Active Learning Approach. Second Edition. – Jones and Bartlett Publishers.
- Кублій Л. І. Алгоритми і структури даних. Основи алгоритмізації : підручник. / Л. І. Кублій. – К. : КПІ ім. Ігоря Сікорського, 2022. – 528 с.
- Нікольский Ю.В. Дискретна математика : Підручник. Видання третє, виправлене та доповнене / Ю. В. Нікольский, В. В. Пасічник, Ю. М. Щербина. – Львів: „Магнолія – 2006”, 2013. – 432 с.
- Шаховська Н. Б. Алгоритми і структури даних : посібник. / Н. Б. Шаховська, Р. О. Голощук. – Львів: „Магнолія – 2006”, 2010. – 215 с.