This article is cited in 2 papers

Automated system for teaching Computational Complexity of Algorithms course

V. S. Rublev, M. T. Yusufov

P.G. Demidov Yaroslavl State University, 14 Sovetskaya str., Yaroslavl, 150003, Russia

Abstract: This article describes problems of designing automated teaching system for “Computational complexity of algorithms” course. This system should provide students with means to familiarize themselves with complex mathematical apparatus and improve their mathematical thinking in the respective area. The article introduces the technique of algorithms symbol scroll table that allows estimating lower and upper bounds of computational complexity. Further, we introduce a set of theorems that facilitate the analysis in cases when the integer rounding of algorithm parameters is involved and when analyzing the complexity of a sum. At the end, the article introduces a normal system of symbol transformations that allows one both to perform any symbol transformations and simplifies the automated validation of such transformations. The article is published in the authors' wording.

Keywords: automated learning, algorithm complexity analysis, algorithm’s symbol scroll table, normal system of symbol transformations.

UDC: 510.52:372.851

Received: 14.04.2017

Language: English

DOI: 10.18255/1818-1015-2017-4-481-495

Bibliographic databases:

•