Об использовании задач двойного назначения в олимпиадах по информатике

Abstract

In this paper the problems for Olympiads of the pupils on Computer Science which decisions can be received by execution of the relevant algorithms and analytically, i.e. by purely mathematical means are considered. Such problems are called dual-use problems. There are 3 types of them: 1) problems solved by executing algorithms; 2) problems whose solution requires the analysis of algorithms to simplify them before the execution; 3) problems solved by mathematical means, without the execution of algorithms. The methodology of developing dual-use problems is illustrated on an example of algorithm of a convergence of numbers. On its basis are formulated 5 problems concerning three specified types. The paper contains decisions of each of these problems. The described approach to the development of problems for the Olympiads of the pupils should promote fuller testing of participants as it allows to evaluate not only their knowledge of the fundamentals of programming, but also their mathematical training.