Dynamic Programming in Tasks of the Russian Unified State Exam in Computer Science

The paper considers the tasks of the Russian Unified State Exam in computer science, solved by the dynamic programming method: finding the number of graph paths, calculating the number of programs, determining the optimal path and final sums, and finding the execution time of processes in a multitasking system are considered in detail. Traditionally, in the press, these tasks are considered separately; this article shows a general approach to solving the considered tasks as dynamic programming tasks. The rationale for the propaedeutics of studying dynamic programming at school, direct analytical and program methods for solving tasks, and the connection between dynamic programming and the developing key/universal competencies of high school students are described.