UDC 004.942
ACADEMIC DISCIPLINE PLANNING TASK SOLUTION BASED ON A GREEDY ALGORITHM
S. V. Skvortsov, Dr. Sc. (Tech.), full professor, RSREU, full professor, Academy of the FPS of Russia, Ryazan, Russia;
orcid.org/0000-0001-9495-4953, e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
A. A. Kuznetsov, master student, RSREU, Ryazan, Russia;
orcid.org/0000-0003-1421-0941, e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
Т. S. Skvortsovа, Ph.D. (Tech.), lecturer, Academy of the FPS of Russia, Ryazan, Russia;
orcid.org/0000-0001-7504-5973, e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
The problem of educational process planning based on the model that takes into account the structure of the academic discipline and its semantics, presented in terms of concepts and logical dependencies between them is considered. The aim is to develop and study an algorithm for determining the order of study of topics (concepts) of academic discipline based on greedy strategy. Algorithm modifications to obtain solutions according to quality criteria based on forgetting function, allowing evaluating students' knowledge, and adjacent connectivity of the studied concepts, characterizing their logical relationship are proposed. The experimental studies results of the developed algorithm with the aim of analyzing performance and quality of the resulting solutions are presented.
Key words: educational process planning, academic discipline model, greedy algorithm, forgetting function, adjacent connectivity criterion.