Geodesic
Automated system for teaching Computational Complexity of Algorithms course
Modelirovanie i analiz informacionnyh sistem, Tome 24 (2017) no. 4, pp. 481-495.

Voir la notice de l'article provenant de la source Math-Net.Ru

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
Mots-clés : normal system of symbol transformations. 
@article{MAIS_2017_24_4_a6,
     author = {V. S. Rublev and M. T. Yusufov},
     title = {Automated system for teaching {Computational} {Complexity} of {Algorithms} course},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {481--495},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2017_24_4_a6/}
}
TY  - JOUR
AU  - V. S. Rublev
AU  - M. T. Yusufov
TI  - Automated system for teaching Computational Complexity of Algorithms course
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2017
SP  - 481
EP  - 495
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2017_24_4_a6/
LA  - en
ID  - MAIS_2017_24_4_a6
ER  - 
%0 Journal Article
%A V. S. Rublev
%A M. T. Yusufov
%T Automated system for teaching Computational Complexity of Algorithms course
%J Modelirovanie i analiz informacionnyh sistem
%D 2017
%P 481-495
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2017_24_4_a6/
%G en
%F MAIS_2017_24_4_a6
V. S. Rublev; M. T. Yusufov. Automated system for teaching Computational Complexity of Algorithms course. Modelirovanie i analiz informacionnyh sistem, Tome 24 (2017) no. 4, pp. 481-495. http://geodesic.mathdoc.fr/item/MAIS_2017_24_4_a6/

[1] Ermilova A. V., Rublev V. S., “Problemy razvitiya matematicheskogo myshleniya uchashchikhsya na primere obuchayushchey sistemy po kursu “Algoritmy i analiz slozhnosti””, Sovremennye informatsionnye tekhnologii i IT-obrazovanie, Sbornik izbrannykh trudov IX Mezhdunarodnoy nauchno-prakticheskoy konferentsii, INTUIT.RU, M., 2014, 297–304 (in Russian)

[2] Cormen T. H., Introduction to algorithms, 3rd ed., MIT press, 2009 | MR | Zbl