Algorithms and data structures

Preparing Students for the design of algorithms for the application.

1. Task algorithmic. Algorithm specification. Algorithm correctness (partial and total). Invariants. Methods of writing algorithms. 2. Memory and time complexity of algorithms. Asymptotic notation. 3. Basic techniques for building algorithms - Recursion. Algorithms from returns; - Divide and conquer; - Dynamic programming; - Greedy method. 4. Algorithms sorting and searching. 5. Dynamic data structures. List, stack, queue. 6. Trees and basic operations on them. Binary search trees. 7. Graphs. Representations, methods search, shortest paths.

A student has basic knowledge of implementation\r\nalgorithmic issues. A student has basic knowledge of data structures,\r\nknows and understands exploration and optimization methods graphs, as well as other algorithmic problems. A student has basic knowledge of implementation\r\nalgorithmic issues A student has basic knowledge of data structures,\r\nknows and understands exploration and optimization methods graphs, as well as other algorithmic problems. A student can perceive metatechnical, system, social and ethical aspects of the proposed engineering tasks and their solutions in data structures. A student understands the need for constant education and learning throughout life. He can do it in a creative way apply the acquired knowledge. He can conquer\r\nneeded information and share knowledge with others. A student understands the need for constant education and learning throughout life. He can do it in a creative way apply the acquired knowledge. He can conquer\r\nneeded information and share knowledge with others.