Unified State Examination in computer science and ICT + programming C++ and Python - course 3000 rub. from Stepik, training 141 lessons, Date: November 30, 2023.

Education: Lipetsk Polytechnic Institute, Lipetsk State Pedagogical Institute. I worked as a programmer and system administrator from 1994 to 2008, from 2008 to the present I have been working at a school and as a private teacher.

At school I became interested in a new subject - computer science. After school, he entered the Lipetsk Polytechnic Institute and a year later transferred to the State Pedagogical Institute. At the institute, in addition to standard BASIC, I began to study the database management systems Clipper and FoxPro. After college, he worked as a programmer for 5 years, after which he began administering computer networks and databases. In my spare time I studied Assembler, C, Delphi. In 2009, he came to work at school as a computer science teacher and subsequently periodically taught mathematics. In the same 2009, I began privately teaching computer science and mathematics (tutor), which is what I do to this day. Hobby: martial arts.

Information
1. Rules for working with the Unified State Exam course
2. About the course, contacts
Custom course.
1. Theoretical framework (editors)
2. Searching for information in a VR text file
3. Array of data in spreadsheets
4. Theoretical basis and video analysis (information models #1)
5. Analysis of information models (#1)
6. Analysis of information models (#2)
7. Analysis of information models (#3)
8. Theoretical basis and video analysis (information models #2)
9. Analysis of information models (#4)
Information and information processes. Encoding information
1. Theoretical basis and video analysis (coding)
2. Encoding information #1
3. Encoding information #2
4. Theoretical basis and video analysis (coding, combinatorics)
5. Information coding #3
6. Information coding (combinatorics) #4
7. Information coding (combinatorics) #5
8. Theory. Lexicographic order and number systems
9. Information coding (combinatorics) #6
10. Theoretical basis and video analysis (amounts of information)
11. Calculating the amount of information #1
12. Calculating the amount of information #2
13. Calculating the amount of information #3
14. Calculating the amount of information #4
Number systems.
1. Theoretical basis of VR
2. Solving basic problems
3. Problem solving (general problems)
4. Problem solving (format until 2023)
5. Problem solving (2023 format)
Fundamentals of game theory.
1. Theoretical basis of VR
2. Practice problems #1 (one pile of stones and similar problems)
3. Practice problems #2 (one pile of stones and similar problems)
4. Practice exercise #1 (two piles of stones)
5. Practice exercise #2 (two piles of stones)
Algebra of logic.
1. Theoretical basis (Algebra of logic)
2. Training tasks (Task 2, #1)
3. Training tasks (Task 2, #2)
4. Training tasks (Task 2, #3)
5. Training tasks (Task 2, #4)
6. Training tasks (Task 2, #5)
7. Training problems (Task 18, Number line:)
8. Training tasks (Task 18, Coordinate beam:)
9. Training problems (Task 18, Inequalities on the xy plane:)
10. Training tasks (Task 18, Expressions with Del (n, m):)
11. Training problems (Task 18, Bit operations:)
Algorithmization. Basic tasks
1. Theoretical basis. Algorithms written in natural language.
2. Algorithms written in natural language #1
3. Algorithms written in natural language #2
4. Algorithms recorded for Turtle
5. Algorithms recorded for Tsaplya
6. Algorithms recorded for Performer (Robot) #1
7. Algorithms recorded for the Performer (Editor) #2
8. Algorithms recorded for the Performer (Editor) #3
9. Theoretical basis (analysis, including writing code)
10. Dynamic Programming #1
11. Dynamic programming #2
12. Dynamic programming #3
13. Data analysis (new task for 2023)
14. Reading and analyzing an algorithm in programming language #1
15. Reading and analyzing an algorithm in programming language #2
16. Recursion #1
17. Recursion #2
18. A simple algorithm for processing a sequence of numbers
19. Previous year assignments (processing number sequences) #1
20. Previous year assignments (processing number sequences) #2
21. Processing number sequences (file input)
Algorithmization. Increased level
1. Theoretical basis (analysis in C++ and Pascal)
2. Problems for training (strings, symbols) (#1#24)
3. Problems for training (strings, symbols) (#2#24:)
4. Problems for training (prime numbers, divisors) (#1#25:)
5. Problems for training (prime numbers, divisors) (#2#25)
6. Problems for training (#1#26:)
7. Processing number sequences (#27:)
8. Processing numerical sequences of pairs and triples of numbers (#27:)
9. Processing number sequences with steps (#27:)
10. Combinatorics (#27:)
11. Training tasks (data array) (#27:)
12. Problems for training (strings, symbols) (#27:)
Computer Science Options
C++ Programming Basics
1. Basic basic concepts. The simplest algorithms
2. Simple linear programs. Real data type
3. Integer arithmetic (C++)
4. Mathematical operations
5. Conditional "if" operator (if)
6. Conditional operator "chess problems"
7. for loop, nested for loops
8. Finding the min/max element
9. while loop
10. do { } while loop
11. One-dimensional array (vector)
12. Recursion
13. Integer type char
14. Strings (char)
15. Strings (string class)
16. Custom Functions
17. Dynamic programming