DEVELOPMENT OF THE FIRST PART OF THE AUTOMATED SYSTEM FOR TEACHING COMPUTATIONAL COMPLEXITY OF ALGORITHMS COURSE

ИССЛЕДОВАНИЯ ОРГАНИЗАЦИИ 1-ОЙ ЧАСТИ ПРОЕКТА

  • Вадим Сергеевич Рублев P.G. Demidov Yaroslavl State University
  • Мурад Теймурович Юсуфов P.G. Demidov Yaroslavl State University

Abstract

Previous articles [1-2] focus on researching the mathematical foundation for developing the automated teaching system (ATS) “Algorithm complexity analysis”. This article addresses issues concerning overall learning process features and learning how to produce symbol scroll tables. The main focus of this article is symbol transformation correctness algorithms.

Author Biographies

Вадим Сергеевич Рублев, P.G. Demidov Yaroslavl State University

Candidate of Physical and Mathematical Sciences, Professor of the Department of Theoretical Informatics

Мурад Теймурович Юсуфов, P.G. Demidov Yaroslavl State University

Post-graduate student of the Department of Theoretical Informatics

References

1. Rublev V.S., Yusufov M.T. Avtomatizirovannaya sistema dlya obucheniya analizu vychislitel'noj slozhnosti algoritmov. Modern Information Technologies and IT-Education. 2016; 12(1):135-145. Available at: https://elibrary.ru/item.asp?id=27539228 (accessed 10.07.2017)
2. Rublev V.S., Yusufov M.T. Automated system for teaching computational complexity of algorithms course. CEUR Workshop Proceedings. 2016; 1763:135-145. Available at: http://ceur-ws.org/Vol-1763 (accessed 10.07.2017)
Published
2017-08-18
How to Cite
РУБЛЕВ, Вадим Сергеевич; ЮСУФОВ, Мурад Теймурович. DEVELOPMENT OF THE FIRST PART OF THE AUTOMATED SYSTEM FOR TEACHING COMPUTATIONAL COMPLEXITY OF ALGORITHMS COURSE. Modern Information Technologies and IT-Education, [S.l.], v. 13, n. 2, p. 170-178, aug. 2017. ISSN 2411-1473. Available at: <http://sitito.cs.msu.ru/index.php/SITITO/article/view/237>. Date accessed: 27 aug. 2025. doi: https://doi.org/10.25559/SITITO.2017.2.237.