1. Introduction to subject content, credit system requirements. Creating algorithms and their characterization, evaluation of algorithms.
2. The encoding properties of codes, shortest length codes, constant change codes (Gray code).
3. Monitoring and self-correcting codes (linear codes, Hamming codes, cyclic codes).
4. Data encryption. Simple and complex data types, program structures, data transfer.
5. Algorithms for searching and sorting files in memory, files with many different elements. Evaluation of algorithms and their performance.
6. External sorting algorithms, sorting combining external files using memory.
7. Dynamic data structures. Linear lists, implementation of stack and queue.
8. Dynamic data structures. Binary trees, search trees.
9. Dynamic data structures. Balancrd trees, optimal trees. B-trees and their use in creating indexes.
10. Solving problems using tree structures. Searching algorithms, heuristic algorithms. Genetic algorithms.
11. Multi-criteria analysis.
12. Data compression, application of algorithms for searching and sorting,
lossless algorithms, the use of hashing.
13. Data compression, loss-making algorithms.
2. The encoding properties of codes, shortest length codes, constant change codes (Gray code).
3. Monitoring and self-correcting codes (linear codes, Hamming codes, cyclic codes).
4. Data encryption. Simple and complex data types, program structures, data transfer.
5. Algorithms for searching and sorting files in memory, files with many different elements. Evaluation of algorithms and their performance.
6. External sorting algorithms, sorting combining external files using memory.
7. Dynamic data structures. Linear lists, implementation of stack and queue.
8. Dynamic data structures. Binary trees, search trees.
9. Dynamic data structures. Balancrd trees, optimal trees. B-trees and their use in creating indexes.
10. Solving problems using tree structures. Searching algorithms, heuristic algorithms. Genetic algorithms.
11. Multi-criteria analysis.
12. Data compression, application of algorithms for searching and sorting,
lossless algorithms, the use of hashing.
13. Data compression, loss-making algorithms.