Automation of Algorithmic Tasks for Virtual Laboratories Based on Automata Theory

Evgeniy A Efimchik,Mikhail S Chezhin,Andrey V Lyamin

doi:10.4108/eai.11-4-2016.151149

Abstract

In the work a description of an automata model of standard algorithm for constructing a correct solution of algorithmic tests is given. The described model allows a formal determination of the variant complexity of algorithmic test and serves as a basis for determining the complexity functions, incl

Highlights

The development of information technologies in education resulted in a wide distribution of electronic teaching instruments, virtual laboratories (VL) being one of them
In this work a method is proposed for formal determination of variants complexity of for algorithmic tests based on automation model of reference algorithm
At every step of the work the controlling automaton forms a new state of the control object on the basis of external medium action, of current state of the control object and of the state of controlling automaton. Applying this model to algorithmic tests, we find that at every step the controlling automaton forms a record of correct solution s, based on the data of test variant v and intermediate results of previous steps fixed in the record of the solution

Summary

Introduction

The development of information technologies in education resulted in a wide distribution of electronic teaching instruments, virtual laboratories (VL) being one of them. In [4] a model of a distributed VL of a standardized structure with automatic checking students’ solutions, which represents VL as a connected up modulus of electronic information-education system, is given. This model allows creation of unified medium of fulfillment for multiple VL on the basis of AcademicNT system. Preparation of the test variants in the automatic way appeared to be an important problem – it was decided to reject the traditional bank of variants owing to its inherent drawbacks In this case, variants of tests must have a predetermined complexity to ensure equal conditions for all students in the estimation of achieved education results. Even knowing the algorithm of solving the test you can fail to meet the schedule of its fulfillment, if a given variant has an excessive complexity

Automata Model of Reference Algorithm

Consideration of Collisions

Formal Determining of Complexity of Algorithmic Tests

Automatic Variant Constructing and Estimation of the Student Solution

Conclusion