Class at Faculty of Mathematics and Physics |
NMUG104
Syllabus
- Time and memory complexity
- Queue and stack
- Basic methods of internal sorting
- Recursion
- Dynamically allocated variables
- Working with linked lists
- Evaluation of arithmetic expressions
- Basic algorithms for computer graphics
- Using libraries
- Principles of creating larger projects
- Object programming
Annotation
The course is a continuation of Computer programming for descriptive geometry I. The aim is to improve programming abilities, to learn various standard algorithms, data structures and the creation of larger projects.