<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Workshop on Cloud Technologies in Education, December</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Three-subject didactic model for teaching algorithmization and programming online</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michael Lvov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hennadiy Kravtsov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ludmila Shishko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olha Hniedkova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Kherson State University</institution>
          ,
          <addr-line>27 Universytetska Str., Kherson, 73003</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>22</volume>
      <issue>2023</issue>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Distance education plays an important role in the context of the COVID-19 pandemic and the growing geopolitical challenges. Electronic educational resources (EER), in particular distance learning courses, are widely used in both secondary and higher education. Requirements for the quality of EER become relevant, especially for ensuring of students' independent activity at practical tasks. For students of the “Software Engineering” specialty, courses in algorithmization and programming are basic. The feature of the “Programming” discipline is the presence of a significant number of tasks on programming mathematical tasks. An analysis of educational literature showed there are practically no thematic tasks books that have important characteristics: a task books is devoted to mathematical tasks programming and is an elementary introduction to computer algebra; supports the most common programming languages in sports programming Pascal, C/C++, Python, etc. The paper proposes the model of learning pedagogical system in the three-subject didactics paradigm. On the example of the course “Practice of Programming Olympiad Tasks” the system of registration and monitoring of mathematical tasks programming using wiki technology is considered. Within the framework of the proposed model of learning pedagogical system, the subsystems of the use of didactic materials of lectures, a task book, practical exercises and laboratory works are described. The methods and tools of organizing support for students' independent activity are illustrated using the example of a workshop for solving Olympiad tasks in programming.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Distance learning</kwd>
        <kwd>online course</kwd>
        <kwd>programming of mathematical tasks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The problems of creating and efective use of distance learning courses, especially in negative situations
when it is impossible to conduct classroom classes, play an important role. The set of these problems
is the subject of theoretical research and practical work outlined in this research. The feature is the
continuation of the research outlined in our work [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and the further use of didactic materials (DM) that
are highlighted there, in the developing and conducting of online basic courses in algorithmization
and programming, using the course “Olympiad Programming Tasks Practice” for students of the
Faculty of Computer Sciences, Mathematics and Physics of Kherson State University.
      </p>
      <p>
        The subject of the study is the distance learning system that supports the developing, use and
maintenance of online electronic educational resources (EER) of the distance course “Programming
mathematical problems. First steps” [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The feature of the distance course (DC) is the combination of
studying theoretical algorithms with practical programming of mathematical tasks, the library of which
consists of author’s tasks and tasks of participants in the educational process. Automation of creation
and storage of tasks in the EER library is one of the tasks of this research. The developed model of the
learning system consists of a subsystem of didactic lecture materials use, support for practical classes
and laboratory work, and support for independent work of students.
      </p>
      <p>
        A review of the scientific-methodical and educational literature shows that there are many textbooks
and problem collections in algorithmization and programming for high school and junior students. First
of all, let’s note the books that are included in the golden fund of the world’s scientific and educational
literature in algorithmization. This is a five-volume encyclopedia of algorithms by Knuth [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ], in which
we especially note the first two volumes, an educational monograph by Dijkstra [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], an interesting
book by Bentley [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], a unique book by Graham et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] devoted to the mathematical foundations of
computer science, and also books by Wirth [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and other classics. Among the recently published ones,
we note the book by Cormen et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        According to the content, EER is an elementary introduction to computer mathematics. Theoretical
aspects of such branch of science as computer algebra are systematically described in [
        <xref ref-type="bibr" rid="ref10 ref11 ref12">10, 11, 12</xref>
        ]. There
are many books on the market in the most popular systems of computer algebra, such as Mathematica,
Maple, Mathcad [
        <xref ref-type="bibr" rid="ref13 ref14 ref15">13, 14, 15</xref>
        ].
      </p>
      <p>
        In Ukraine, as in other countries, various programming competitions are held for schoolchildren and
students, which are called sports programming. That is why books by authors who are specialists in
sports programming and activists of the Ukrainian Olympic movement deserve special attention. The
materials of the All-Ukrainian Programming Olympiads were included in many problem books, for
example, [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Description of the pedagogical system and problem statement</title>
      <p>
        The practical results of this study were obtained at teaching of disciplines in algorithmization of
programming developed at the Department of Computer Sciences and Software Engineering of Kherson
State University using the following educational software systems:
• Software-methodological complex “Video Interpreter of Search and Sorting Algorithms” [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
• Collection “Programming of mathematical tasks. First steps” [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
• Software complex “Web OAP Fundamentals of Algorithmization and Programming” in the distance
learning system (DLS) “KSU online” [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ],
and at studying the following disciplines:
• Programming. Programming language C.
• Programming. programming language Python.
• Fundamentals of algorithmization and programming.
• Algorithms and data structures.
• Workshop on solving Olympiad problems.
      </p>
      <p>• Computer algebra fundamentals.</p>
      <p>Didactic materials of DC “Programming of mathematical tasks. First steps” have the following
programmatic structure:
• The distance course is a complex of interrelated software training modules Textbook, Task book,
mathematical tasks editor.
• The textbook consists of thematic sections of mathematical tasks and methodical instructions for
solving mathematical tasks in the format of algorithms in the form of program code.
• The task book for each thematic section contains a number of tasks with their solutions: the
text of the task, a description of the solution algorithm, and program code in three programming
languages: Pascal, C/C++, and Python.
• The math problem editor provides users with the ability to create new tasks in the Task book.</p>
      <p>
        Distance course support is based on maintaining the quality of tasks developed in the EER library
thanks to wiki technology use [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>The purpose of the research is to study the teaching methodology and software of the distance course
“Programming of mathematical tasks. First steps”, namely to investigate
1. Description of the pedagogical system and construction of its model based on the interaction of
subjects of the educational process.
2. Subsystems description of the didactic materials use of the Task book.
3. Description of the registration subsystem and the use of new tasks in the collection.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Description of the pedagogical system and problem statement</title>
      <p>
        Our approach is based on the paradigm of the three-subject didactics [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], which consists in an efective
combination of methods of lecture courses (direct teacher-student feedback), conducting practical classes
and laboratory work (current feedback), control (final control), independent activity (self-control) of
the student with didactic materials and other sources of educational information.
      </p>
      <p>The learning process model is presented in figure 1.</p>
      <sec id="sec-3-1">
        <title>Teacher</title>
      </sec>
      <sec id="sec-3-2">
        <title>Student</title>
        <p>New knowledge
Knowledge control</p>
      </sec>
      <sec id="sec-3-3">
        <title>Learning tools</title>
        <p>The learning process is the main educational process; all other educational processes are subordinate
to its implementation. The learning process is complex in terms of content and a long-term process, for
its implementation the significant human, material and financial resources are involved, and the state
infrastructure has been created. Therefore, there is every reason to consider the learning process as a
business process.</p>
        <p>The main tasks of the program system of educational purpose:
1. Relevance ensuring, availability and quality of learning tools.
2. Supporting of the process of new knowledge transferring.
3. Supporting of the process of students’ independent activity.
4. Knowledge control support (feedback).</p>
        <p>Our approach is based, on the one hand, collections of problems in algorithmization and programming
are basic, supporting didactic materials for studying several topics, and, on the other hand, each topic
relies on several problems in the collection. The example of the key thesis.</p>
        <p>Example 1 shows the ratio Task (algorithm) ←→Topic of the discipline.</p>
        <p>Example 1. Ratio Task (Algorithm) ←Topic of discipline
Topic: Floyd’s Algorithm
• Shortest path problem.
• Method of dynamic programming.
• Oriented graph adjacency matrix.
• Estimation of algorithm complexity by time according to the control structure.</p>
        <p>• Python programming language: attached management operators.</p>
        <p>Ratio Topic of discipline ←Task (Algorithm)
Topic: Divide and Posses programming method
• Search for a fake coin using simple scales.
• Binary search in an ordered list.
• Algorithm for sorting lists by merging.</p>
        <p>• Karatsuba’s algorithm for multiplying polynomials.</p>
        <p>So, at developing a course for learning a certain discipline from the basics of algorithmization and
programming, programming problems and material that explains their solution are those didactic units
that make up the actual basis of one or another didactic material.</p>
        <p>From our point of view, the online course in the basics of algorithmization and programming contains
the following types of educational work:
• lectures,
• practical training,
• laboratory work,
• control,
• independent activity.</p>
        <p>So, the main methodological and technological requirements and basic architectural solutions to the
software system for educational purpose, which supports the formation and use of programming tasks
as reference units of didactic materials, are considered.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Subsystem of didactic materials using of the Task book</title>
      <p>Efective use of electronic Task books, first of all, requires the creation of a subsystem that supports
the didactic materials (DM) expansion of the Task book with new reference units. Let’s consider the
requirements for subsystems supporting the learning process.</p>
      <p>• Requirements for the composition of the task as a reference unit of DM.
• Requirements for the process of the task quality maintaining as a reference unit of DM.
• Requirements for the process of supporting practical classes and laboratory works.
• Requirements for the process of supporting students’ independent work.</p>
      <p>• Requirements for the process of creating, editing and monitoring tasks in the EER library.</p>
      <sec id="sec-4-1">
        <title>4.1. Subsystem of using didactic lecture materials</title>
        <p>The peculiarity of lecture materials for educational disciplines in algorithmization and programming on
arbitrary topics is that they are based on several algorithms. The lecture should contain the algorithms
and their explanations. The presentation should also contain these algorithms. Finally, the package of
didactic lecture materials should be supplemented with a video lecture. Thus, our educational software
system should support the selection process of individual algorithms and programs and the compilation
in a single file of the basis for the text of the lecture and presentation.</p>
        <p>The package of lecture didactic materials (LDM) consists of the following didactic units:
• abstract of the lecture,
• full text of the lecture,
• presentation of lectures,
• video lectures.</p>
        <p>The author (compiler) of the discipline
The title of discipline
The list is the discipline content</p>
        <p>From our point of view, the didactic provision of the lecture (DPL) of a certain discipline has the
following structure:
Name of the lecture
Lecture plan
Abstract of the lecture</p>
        <p>Link Full text of the lecture</p>
        <p>Examples
Link Presentation of the lecture</p>
        <p>Link Video lectures</p>
        <p>Of course, we guide the lecturers – users of the system to create author’s courses. Therefore, the
DPL support subsystem has the following functionality:</p>
        <p>Functions of the author
• Function of registration Author – course (new course).
• Function of package title editing (List-content (Lecture title, lecture plan, lecture abstract)).
• Function of lecture completing with tasks from the collection.
• Functions of lecture text editing (filling with other materials).
• Functions of editing of lecture presentation (filling with other materials).
• Function of adding a video lecture to the LDM (must be performed by the author after the lecture,
which is automatically recorded in a software system such as Zoom)
• Function of presentation of video lecture.</p>
        <p>Functions of the student
• View of package title and select a lecture.
• Reading of the full lecture text.
• Using the presentation.</p>
        <p>• Watch videos.</p>
        <p>The functionality we have provided is actually standard. The exception is the function of completing
the lecture with tasks from the collection, which makes a connection between the collection of tasks
(Task book) and didactic lecture materials.</p>
        <p>
          Let’s consider the structure of the Task book. The Task book contains a set of tasks structured by
content. An example is the structure of the Task book “Programming of mathematical tasks. First steps”,
full information about it [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] and concisely – the item “Overview of software systems ...”
        </p>
        <p>The Task book is written in Ukrainian, English and Russian. It supports Pascal, C, Python
programming languages. The first three sections are the main ones, the 4th and 5th are intended for independent
work and control. The structure of the task from the main section is as follows:</p>
        <p>Task No. Task condition.</p>
        <p>Instructions for the solution</p>
        <p>Program text</p>
        <p>Lecturer can choose any element of the structure independently of others. Consider an example of a
structured lecture.</p>
        <p>Example 2. Lecture “Real-time algorithms”
Lecture 11. Real-time algorithms
Plan.
1. Introduction. Concept of real-time algorithm.
2. Task 3.7. Search by pattern. Lexical analysis.</p>
        <p>2.1. The concept of a finite automaton.
2.2. Construction of a finite automaton for the pattern search problem.
3.1. Solving problems of lexical analysis in real time
3.2. Task 3.4. Information system of the bank.
4. Syntactic analysis.</p>
        <p>4.1. Task 3.2. Correctly spaced parentheses.</p>
        <p>4.2. Task 3.3. Correctly constructed arithmetic expressions
5. Conclusion
6. Literature.</p>
        <p>It should be noted that 95 percent of the full text of the lecture is made up of the tasks given in the plan.
The conditions of the problems and instructions for solving them are given in full. Lecture presentations
are formed semi-automatically. Slides, generated by the system contain only the conditions of the
tasks. The lecturer has the opportunity to change the text of the lecture, forming other slides of the
presentation.</p>
        <p>Subsystem models of LDM support</p>
        <p>The mathematical model of the LDM support process is a bipartite graph of ratio Task – Topic
(Example 1)</p>
        <p>At creating lecture didactic materials, if the lecturer includes author’s fragments in the text of the
basic text of the lecture as a collection of tasks, the copyright protection function must be implemented.</p>
        <p>Other functions to support the technology of selection, basis of the lecture, presentation and
subsequent editing and use of the author’s lecture materials should be selected and implemented.</p>
        <p>The topic for the task is chosen by the user – the lecturer. Thus, the subgraph defining the :: “topicality”
of ratio Task – Topic has the form</p>
        <p>Therefore, the set of such connections is the result of the work of several lecturers, each uses this
task for his own purpose.</p>
        <p>Methodical assistance is provided by the sub-graph, which accumulates collective experience of the
Task book using.</p>
        <p>Therefore, the subsystem functionality should support editing (adding topics) and using both types
of representation of bipartite graph Task – Topic.</p>
        <p>The subsystem should also support the bipartite graph formation</p>
        <p>N</p>
        <p>N</p>
        <p>Topic
1</p>
        <p>N</p>
        <p>Topic
1
1</p>
        <p>Topic</p>
        <p>Lecture
Task
Task
Task
Task</p>
        <p>N
N</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Support of subsystem for practical classes and laboratory works</title>
        <p>The practical part of the educational process in the disciplines of algorithmization and programming
can consist of such forms of classes as
• laboratory work,
• practical training,
• control,
• tests.</p>
        <p>The main purpose of the practical part is to carry out reverse control of the assimilation of the
theoretical provisions of the discipline. The distance form of education requires new approaches
determined by the distance form itself.</p>
        <p>From our point of view, regardless of the discipline, laboratory work is mandatory. Ideally, the set
of programming tasks of the proposed structure is a suficient source of didactic materials. However,
the application of the tasks set in some disciplines requires a qualitative expansion of the topics. The
example is a discipline “Algorithms and data structures”. Here are the mandatory topics:
Data structures and ATD algorithms Lists, Queues, Stacks, Trees.</p>
        <p>Data structures and ATD algorithms Insert, Delete, Find.</p>
        <p>Sort and search.</p>
        <p>Algorithms on graphs.</p>
        <p>Algorithms of computational geometry.</p>
        <p>Ideally, the Task book should contain a suficient number of tasks from these topics. We plan to
expand the system of tasks in the direction of universalization.</p>
        <p>Support of laboratory works. Note, the laboratory support subsystem must distribute, form
individual tasks and check these tasks. However, these subsystem functions are standard and
wellknown, so we do not consider them.</p>
        <p>
          The basic sections for automatic distribution and formation of individual laboratory work packages
are sections 4 and 5 of the Task book. The most dificult is the problem of checking the correctness of
computer programs – the results of laboratory work. The standard approach is to create computer test
packages for each task of these sections. This approach is implemented, in particular, in the Web OAP
system [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. However, this approach requires considerable time and quality control.
        </p>
        <p>Support of practical classes. From our point of view, practical classes are an important form of
the learning process in distance learning. Our practice has shown the importance of regular two-way
communication between teacher and student. To implement this approach, it is suggested to plan
a thematic plan of practical classes, 2 academic hours are assigned to each topic with the following
functionality:</p>
        <p>Topic of practical lesson</p>
        <p>Instructional lesson. Teacher’s comments and instructions on general practical techniques for writing
programs on this topic. Distribution of tasks for independent solution and preparation by each student
of the subgroup of a short report on their task.</p>
        <p>Final lesson. Introductory speech of the teacher. Brief messages from each of the students about
the algorithm and program of their task. Discussions on the topic of the message. Practical training
assessment.</p>
        <p>Teacher
1</p>
        <p>N
Т</p>
        <p>Student</p>
        <p>Task for solution and message
Message of task solving
For example, at studying disciplines:
• Workshop in Olympiad programming tasks solving
• Computer algebra fundamentals
The following tasks are considered on the specified topic.</p>
        <p>Topic: Algorithms for solving elementary algebraic tasks
Tasks.
1. Solving of a system of linear inequalities of one variable with rational coeficients.
2. Search for rational roots of the reduced cubic equation.
3. Calculation of the integral coeficients of a cubic equation by its rational roots (Viet’s theorem).
4. Analysis of a cubic equation with integer coeficients for the number of real roots
5. Analysis of a cubic equation with integer coeficients for the existence of roots of multiples of 2.
6. Solution of the reduced quadratic equation with integer coeficients in radicals
7. Solving a linear equation with modules
8. Karatsuba’s algorithm of multiplying two polynomials with integer coeficients.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Independent activity support. Tests and control</title>
        <p>Independent activity should be performed independently, without current control of its execution. The
result of independent work is completed laboratory work and solved tasks of practical classes.</p>
        <p>
          One of the most efective tasks of students’ independent work is the task of a mathematical task
creating and upload it to the EER library of the distance course “Programming of Mathematical Problem.
First steps” [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
        <p>
          The main stage of the learning process is the knowledge control process acquired by the student at
the stages of explaining new material and practical work. Knowledge control is the form of feedback in
the education system that ensures the quality of acquired knowledge as the main goal of the education
system. The teacher, according to the discipline plan, has the opportunity to conduct tests and control.
Ideally, feedback should be provided constantly, so monitoring of knowledge in various forms is part of
the structure of any type of learning course. Without going into a detailed analysis of diferent types of
control, it is important to control both declarative knowledge and procedural knowledge. Computer
methods for controlling declarative knowledge are suficiently developed [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. In the IMS [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] and
SCORM [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] standards, 20 types of test tasks are described, starting from the simplest test questions
with an answer (YES, NO) and ending with complex questions. The answer is the educational task
solving or laboratory work performing.
        </p>
        <p>
          Tests should be used to control of theoretical knowledge. However, complex test tasks are open in the
standard and are not supported by any of the known testing systems, since their implementation must be
based on knowledge of a specific subject area and requires special eforts. Therefore, the construction of
computer systems for testing productive knowledge, in particular, in the exact sciences, is an important
problem. In [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], the approach based on the use of mathematical models and templates of test tasks is
proposed. Unfortunately, this approach cannot be applied to the disciplines of algorithmization and
programming. Therefore, the results of practical and laboratory work are the main form of control of
students’ success.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Subsystem of registration and use of new tasks in the Task book</title>
      <p>
        The subsystem of registration and use of new tasks covers all three subjects of the learning process
model. According to the paradigm of the three-subject didactics, the Learning tools element has the
properties of a subject, because it has direct and reverse connections with other subjects of the system
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. The Learning Tools are directly and feedback related to the Teacher and the Student (figure 2).
      </p>
      <p>Teacher</p>
      <p>New EER</p>
      <p>As already mentioned above, the feature of DC is the presence of a significant number of mathematical
tasks in the library of EER. The variability of these tasks can be high, because students have the
opportunity to create new tasks or edit existing ones. In this way, students perform the function of
quality control of the formulation of a mathematical task, the proposed algorithm for its solution, and
the development of software code. The teacher has an expert role and he monitors the quality of tasks.</p>
      <p>The participation of students in the developing and support of tasks in the EER library performs an
important function of encouraging and increasing the motivation of students to intensify creative work
in researching new algorithms for solving mathematical problems, improving the software code and
ensuring the EER quality.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>The pedagogical system is described and the learning process model of students of “Software Engineering”
specialty in the disciplines of algorithmization and programming is developed. The paper proposes
the model of the pedagogical learning system in the paradigm of the three-subject didactics. A feature
of the discipline “Programming” is the presence of a significant number of tasks in programming of
mathematical tasks. The problem with updating and creating new tasks is solved with the help of wiki
technology. On the example of the course “Practice of Programming Olympiad Tasks” the system of
registration and monitoring of programming of mathematical tasks is considered.</p>
      <p>Within the framework of the proposed model of the pedagogical learning system, subsystems of the
use of didactic materials of lectures, notebooks, practical and laboratory work are described. Using
the example of a workshop on solving Olympiad programming tasks, the methodology and means of
organizing support for students’ independent work are illustrated.</p>
      <p>The research’s results are based on the experience of teaching disciplines in algorithmization and
programming of mathematical tasks at the Department of Computer Sciences and Software Engineering
of Kherson State University.</p>
      <p>
        To assess the prospects for using the Web-application “Programming of Mathematical Tasks” in the
educational process, the expert method was applied. The twelve experienced teachers in mathematics
of Kherson secondary schools were interviewed. For evaluation, a five-point Likert system was chosen
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lvov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kravtsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Shishko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Hniedkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Chernenko</surname>
          </string-name>
          , E. Kozlovsky, About Electronic Textbook “
          <article-title>Mathematical Tasks Programming. First Steps”</article-title>
          , in: O.
          <string-name>
            <surname>Ignatenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Kharchenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Kobets</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Kravtsov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Tarasich</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Ermolayev</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Esteban</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Yakovyna</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Spivakovsky (Eds.),
          <source>ICTERI 2021 Workshops</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>334</fpage>
          -
          <lpage>349</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -14841-5_
          <fpage>22</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lvov</surname>
          </string-name>
          , Mathematical Tasks Programming.
          <source>Initial Steps</source>
          ,
          <year>2021</year>
          . URL: http://dls.ksu.ks.ua/dls/ Library/LibdocView.aspx?id=
          <fpage>dcb175b1</fpage>
          -7ac0
          <string-name>
            <surname>-</surname>
          </string-name>
          4cb8
          <string-name>
            <surname>-</surname>
          </string-name>
          b97a-5448a2fca0f7.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Knuth</surname>
          </string-name>
          ,
          <source>The Art of Computer Programming</source>
          , volume
          <volume>1</volume>
          :
          <string-name>
            <given-names>Fundamental</given-names>
            <surname>Algorithms</surname>
          </string-name>
          , 3 ed.,
          <source>Addison-Wesley</source>
          ,
          <year>1997</year>
          . URL: https://doc.lagout.org/science/0_Computer%20Science/2_Algorithms/ The%20Art
          <source>%20of%20Computer%20Programming%20</source>
          (vol.%
          <volume>201</volume>
          _%20Fundamental%20Algorithms) %
          <volume>20</volume>
          (
          <issue>3rd</issue>
          %
          <fpage>20ed</fpage>
          .)%
          <volume>20</volume>
          %5BKnuth%
          <fpage>201997</fpage>
          -
          <lpage>07</lpage>
          -17%5D.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Knuth</surname>
          </string-name>
          ,
          <source>The Art of Computer Programming</source>
          , volume
          <volume>2</volume>
          :
          <string-name>
            <given-names>Seminumerical</given-names>
            <surname>Algorithms</surname>
          </string-name>
          , 3 ed.,
          <source>Addison-Wesley</source>
          ,
          <year>1997</year>
          . URL: https://doc.lagout.org/science/0_Computer%20Science/2_Algorithms/ The%20Art
          <source>%20of%20Computer%20Programming%20%28vol.%202_%20Seminumerical% 20Algorithms%</source>
          <volume>29</volume>
          %
          <fpage>20</fpage>
          %283rd%
          <fpage>20ed</fpage>
          .%
          <volume>29</volume>
          %
          <fpage>20</fpage>
          %5BKnuth%
          <fpage>201997</fpage>
          -
          <lpage>11</lpage>
          -14%5D.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E. W.</given-names>
            <surname>Dijkstra</surname>
          </string-name>
          ,
          <source>A Discipline of Programming</source>
          , volume
          <volume>613924118</volume>
          ,
          <string-name>
            <surname>Prentice-Hall</surname>
          </string-name>
          , Inc.,
          <string-name>
            <surname>Englewood</surname>
            <given-names>Clifs</given-names>
          </string-name>
          , NJ,
          <year>1976</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bentley</surname>
          </string-name>
          , Programmimg Pearls,
          <string-name>
            <surname>Addison-Wesley Professional</surname>
          </string-name>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Graham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Knuth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Patashnik</surname>
          </string-name>
          ,
          <article-title>Concrete mathematics: a foundation for computer science</article-title>
          , Addison-Wesley
          <string-name>
            <surname>Professional</surname>
          </string-name>
          ,
          <year>1994</year>
          . URL: https://doc.lagout.org/science/0_Computer%20Science/ 3_Theory/Mathematics/Concrete%20Mathematics.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Wirth</surname>
          </string-name>
          ,
          <source>Algorithms and Data Structures (Oberon version)</source>
          ,
          <year>2004</year>
          . URL: https://web.archive.org/ web/20110813043427/http://www.ethoberon.ethz.ch/WirthPubl/AD.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T. H.</given-names>
            <surname>Cormen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. E.</given-names>
            <surname>Leiserson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Rivest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Stein</surname>
          </string-name>
          , Introduction to Algorithms, 4 ed., The MIT Press, Cambridge, Massachusetts and London, England,
          <year>2022</year>
          . URL: https://dl.ebooksworld.ir/books/Introduction.to.
          <source>Algorithms.4th.Leiserson.Stein.Rivest.Cormen</source>
          . MIT.Press.9780262046305.EBooksWorld.ir.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Akritas</surname>
          </string-name>
          ,
          <source>Elements of Computer Algebra With Applications</source>
          , John Wiley &amp; Sons, Inc.,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P.</given-names>
            <surname>Naudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Quitté</surname>
          </string-name>
          ,
          <article-title>Algorithmique algébrique avec exercices corrigés</article-title>
          , Dunod,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Davenport</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Siret</surname>
          </string-name>
          , É. Tournier,
          <source>Computer Algebra: Systems and Algorithms for Algebraic Computation</source>
          , 2 ed., Academic Press Ltd.,
          <year>1988</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>V. P.</given-names>
            <surname>Dyakonov</surname>
          </string-name>
          ,
          <source>Mathematica 4.1 / 4.2 / 5</source>
          .
          <article-title>0 in mathematical and scientific-technical calculations</article-title>
          , SOLON-Press, Moscow,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V. P.</given-names>
            <surname>Dyakonov</surname>
          </string-name>
          , Maple 9 in mathematics, physics and education, SOLON-Press, Moscow,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>V. Z.</given-names>
            <surname>Aladjev</surname>
          </string-name>
          ,
          <source>Computer algebra systems: Maple: The art of programming</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>N. O.</given-names>
            <surname>Herasymchuk</surname>
          </string-name>
          ,
          <article-title>Rozviazannia olimpiadnykh zadach z prohramuvannia (navchalnyi posibnyk dlia slukhachiv viddilennia kompiuternykh nauk MAN): navch. posib. dlia slukhachiv sektsii viddilennia kompiuternykh nauk</article-title>
          ,
          <source>VO MAN, Lutsk</source>
          ,
          <year>2010</year>
          . URL: http://vvman.lutsk.ua/file/k60.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>A. M. Hurzhii</surname>
            ,
            <given-names>V. V.</given-names>
          </string-name>
          <string-name>
            <surname>Bondarenko</surname>
          </string-name>
          ,
          <article-title>Rekomendatsii do rozviazuvannia zadach Mizhnarodnykh i Vseukrainskykh olimpiad sered uchniv : navchalno-memodychnyi posibnyk</article-title>
          ,
          <source>Kyiv</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Lvov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Spivakovskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. V.</given-names>
            <surname>Zaitseva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Kravtsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Kot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. H.</given-names>
            <surname>Kravtsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. S.</given-names>
            <surname>Herasymenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. S.</given-names>
            <surname>Peschanenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Hrabovskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. O.</given-names>
            <surname>Khoruzhenko</surname>
          </string-name>
          ,
          <article-title>Prohramno-metodychnyi kompleks “Videointerpretator alhorytmiv poshuku ta sortuvannia” (“</article-title>
          <source>Videointerpretator”)</source>
          ,
          <year>2002</year>
          . URL: https://www.kspu.edu/About/DepartmentAndServices/DigitalInfrastructure/ internationalprojects/NationalProjects/Videointerpreter_algorithms_for_search_n_sorting. aspx?lang=uk.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19] Kherson State University, Services and
          <string-name>
            <given-names>Information</given-names>
            <surname>Resources</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://www.kspu.edu/ Information/services.aspx?lang=en.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>E. O.</given-names>
            <surname>Kozlovskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Kravtsov</surname>
          </string-name>
          ,
          <article-title>Resource of training “Wiki-document” in system “Kherson Virtual University”</article-title>
          ,
          <source>Journal of Information Technologies in Education (ITE) 15</source>
          (
          <year>2013</year>
          )
          <fpage>255</fpage>
          -
          <lpage>262</lpage>
          . URL: https://ite.kspu.edu/index.php/ite/article/view/309.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Spivakovsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Petukhova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Spivakovska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kotkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kravtsov</surname>
          </string-name>
          ,
          <string-name>
            <surname>Three-Subjective Didactic</surname>
          </string-name>
          Model, in: V.
          <string-name>
            <surname>Ermolayev</surname>
            ,
            <given-names>H. C.</given-names>
          </string-name>
          <string-name>
            <surname>Mayr</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Nikitchenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Spivakovsky</surname>
          </string-name>
          , G. Zholtkevych (Eds.), Information and Communication Technologies in Education, Research, and Industrial Applications, Springer International Publishing, Cham,
          <year>2013</year>
          , pp.
          <fpage>252</fpage>
          -
          <lpage>273</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>319</fpage>
          -03998-5_
          <fpage>13</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Lvov</surname>
          </string-name>
          ,
          <article-title>Mathematical tests in computer math systems for educational purposes</article-title>
          ,
          <source>Control Systems and Machines</source>
          (
          <year>2011</year>
          )
          <fpage>60</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <source>[23] 1EdTech Consortium</source>
          , Inc, Home | 1EdTech,
          <year>2024</year>
          . URL: https://www.1edtech.org/.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Rustici Software</surname>
            <given-names>LLC</given-names>
          </string-name>
          ,
          <article-title>SCORM.com HomePage: What is SCORM</article-title>
          and How it Works,
          <year>2024</year>
          . URL: https://scorm.com.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lvov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kuzmenkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kravtsov</surname>
          </string-name>
          ,
          <article-title>System for Testing Physics Knowledge</article-title>
          , in: V.
          <string-name>
            <surname>Ermolayev</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Mallet</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Yakovyna</surname>
            ,
            <given-names>H. C.</given-names>
          </string-name>
          <string-name>
            <surname>Mayr</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Spivakovsky (Eds.), Information and Communication Technologies in Education, Research, and Industrial Applications, Springer International Publishing, Cham,
          <year>2020</year>
          , pp.
          <fpage>186</fpage>
          -
          <lpage>209</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -39459-
          <issue>2</issue>
          _
          <fpage>9</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>