Open AccessAutomated verification of expression transformation chains based on computational experiments
Author(s) -
F. A. Novikov,
Viktor Katsman,
Vladislav Mosin
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/734/1/012132
Subject(s) - task (project management) , computer science , expression (computer science) , set (abstract data type) , transformation (genetics) , process (computing) , theoretical computer science , chain (unit) , programming language , systems engineering , biochemistry , chemistry , physics , astronomy , engineering , gene
The solution of mathematical and logical problems is the imperative element of the educational process in the technical sciences. To solidify the assimilated skills, learner need to solve a large number of educational tasks, that leads to the need of checking of a large number of solutions. In lots of cases the solution of an educational task is the chain of expression transformations. Many systems allow to compare the learner’s answer with the correct one, defined by the teacher. But in some cases, the teacher needs to set some additional information, besides the answer expression. Such additional information cannot be set for each possible pair of expressions in each possible solution chain of the task. We propose a method for verifying task solutions, based on the computational experiments between each pair of steps in solution chain. The proposed approach was tested and showed good results. Namely, in the experiments the efficiency of the teacher’s work when checking solutions increased more than 4 times.