Task and algorithms to conceive an action plan for the updating of learning content

Download article in PDF format

Authors: Gorodovich A. V., Kruchinin V. V., Suschenko S. P.

Annotation: This paper discusses the problem of creation and updating of learning content for university e-learning system, and approaches to it. The paper proposes a mathematical problem statement through maximization of the cumulative ratings of elearning content elements with limits set for resources. Two solutions are proposed: for a discrete case, the problem is reduced to a knapsack problem variation and is solved using dynamic programming methods, and the general case which is addressed using the genetic algorithm. The authors have studied the genetic algorithm and defined its convergence properties and computational complexity.

Keywords: learning content, content upgrade, rating, dynamic programming algorithm, genetic algorithm, convergence, computational complexity

Editorial office address

Executive Secretary of the Editor’s Office

 Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia

  Phone / Fax: + 7 (3822) 701-582

  journal@tusur.ru

 

Viktor N. Maslennikov

Executive Secretary of the Editor’s Office

 Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia

  Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02

  vnmas@tusur.ru

Subscription for updates