Automated System for Teaching Computational Complexity of Algorithms Course

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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Modelirovanie i analiz informacionnyh sistem Ročník 24; číslo 4; s. 481 - 495
Hlavní autori:	Roublev, Vadim S., Yusufov, Murad T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Yaroslavl State University 01.08.2017
Predmet:	algorithm complexity analysis algorithm’s symbol scroll table automated learning normal system of symbol transformations
ISSN:	1818-1015, 2313-5417
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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.
ISSN:	1818-1015 2313-5417
DOI:	10.18255/1818-1015-2017-4-481-495