Algorithms and Data Structures (cs-1)
Type: Normative
Department: programming
Curriculum
| Semester | Credits | Reporting |
| 2 | 4 | Differentiated setoff |
Lectures
| Semester | Amount of hours | Lecturer | Group(s) |
| 2 | 32 | Associate Professor S. V. Litynskyi | PMi-11, PMi-12, PMi-13 |
Laboratory works
| Semester | Amount of hours | Group | Teacher(s) |
| 2 | 32 | PMi-11 | Associate Professor S. V. Litynskyi, Associate Professor S. A. Yaroshko |
| PMi-12 | Associate Professor S. V. Litynskyi, Associate Professor S. A. Yaroshko | ||
| PMi-13 | Associate Professor S. V. Litynskyi, Associate Professor S. A. Yaroshko |
Course description
Asymptotic Analysis of Time and Space Complexity
Big-O, Big-Omega, Big-Theta Notation
Sorting (Quadratic, Linearithmic, Special-Case Linear)
Search (Trees, Hash Tables)
Graphs, Pathfinding
Dynamic Programming
Complexity Classes (P, NP, NPC, NPH)
С & Java