<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Three-subject didactic model for teaching algorithmization and programming online</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Michael</forename><surname>Lvov</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Kherson State University</orgName>
								<address>
									<addrLine>27 Universytetska Str</addrLine>
									<postCode>73003</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Hennadiy</forename><surname>Kravtsov</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Kherson State University</orgName>
								<address>
									<addrLine>27 Universytetska Str</addrLine>
									<postCode>73003</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ludmila</forename><surname>Shishko</surname></persName>
							<email>lshishko59@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="institution">Kherson State University</orgName>
								<address>
									<addrLine>27 Universytetska Str</addrLine>
									<postCode>73003</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Olha</forename><surname>Hniedkova</surname></persName>
							<email>gnedkova84@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="institution">Kherson State University</orgName>
								<address>
									<addrLine>27 Universytetska Str</addrLine>
									<postCode>73003</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Three-subject didactic model for teaching algorithmization and programming online</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">B7B3B9C16A9A06858ABA82E8844D205C</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:46+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Distance learning, online course, programming of mathematical tasks O. Hniedkova) 0000-0002-0876-9928 (M. Lvov)</term>
					<term>0000-0003-3680-2286 (H. Kravtsov)</term>
					<term>0000-0001-9346-4338 (L. Shishko)</term>
					<term>0000-0001-5194-2194 (O. Hniedkova)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>The problems of creating and effective 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 <ref type="bibr" target="#b0">[1]</ref> 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" <ref type="bibr" target="#b1">[2]</ref>. 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 <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>, in which we especially note the first two volumes, an educational monograph by Dijkstra <ref type="bibr" target="#b4">[5]</ref>, an interesting book by Bentley <ref type="bibr" target="#b5">[6]</ref>, a unique book by Graham et al. <ref type="bibr" target="#b6">[7]</ref> devoted to the mathematical foundations of computer science, and also books by Wirth <ref type="bibr" target="#b7">[8]</ref> and other classics. Among the recently published ones, we note the book by Cormen et al. <ref type="bibr" target="#b8">[9]</ref>.</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 <ref type="bibr" target="#b9">[10,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12]</ref>. There are many books on the market in the most popular systems of computer algebra, such as Mathematica, Maple, Mathcad <ref type="bibr" target="#b12">[13,</ref><ref type="bibr" target="#b13">14,</ref><ref type="bibr" target="#b14">15]</ref>.</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, <ref type="bibr" target="#b15">[16,</ref><ref type="bibr" target="#b16">17]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Description of the pedagogical system and problem statement</head><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:</p><p>• Software-methodological complex "Video Interpreter of Search and Sorting Algorithms" <ref type="bibr" target="#b17">[18]</ref>.</p><p>• Collection "Programming of mathematical tasks. First steps" <ref type="bibr" target="#b0">[1]</ref>. • Software complex "Web OAP Fundamentals of Algorithmization and Programming" in the distance learning system (DLS) "KSU online" [19],</p><p>and at studying the following disciplines:</p><p>• Programming. Programming language C. • Programming. programming language Python.</p><p>• Fundamentals of algorithmization and programming.</p><p>• Algorithms and data structures.</p><p>• 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:</p><p>• 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 <ref type="bibr" target="#b18">[20]</ref>.</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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Description of the pedagogical system and problem statement</head><p>Our approach is based on the paradigm of the three-subject didactics <ref type="bibr" target="#b19">[21]</ref>, which consists in an effective 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 <ref type="figure" target="#fig_0">1</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Teacher</head><p>New knowledge</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Knowledge control</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Learning tools</head><p>Student 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:</p><p>1. Relevance ensuring, availability and quality of learning tools.</p><p>2. Supporting of the process of new knowledge transferring.</p><p>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. Example 1. Ratio Task (Algorithm) ←Topic of discipline Topic: Floyd's Algorithm</p><p>• Shortest path problem.</p><p>• Method of dynamic programming.</p><p>• Oriented graph adjacency matrix.</p><p>• Estimation of algorithm complexity by time according to the control structure.</p><p>• Python programming language: attached management operators.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Ratio Topic of discipline ←Task (Algorithm) Topic: Divide and Posses programming method</head><p>• Search for a fake coin using simple scales.</p><p>• Binary search in an ordered list.</p><p>• Algorithm for sorting lists by merging. • 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:</p><formula xml:id="formula_0">• lectures, • practical training, • laboratory work, • control, • independent activity.</formula><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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Subsystem of didactic materials using of the Task book</head><p>Effective 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.</p><p>• Requirements for the process of the task quality maintaining as a reference unit of DM.</p><p>• Requirements for the process of supporting practical classes and laboratory works.</p><p>• Requirements for the process of supporting students' independent work. • Requirements for the process of creating, editing and monitoring tasks in the EER library.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Subsystem of using didactic lecture materials</head><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:</p><p>• abstract of the lecture,</p><p>• full text of the lecture,</p><p>• presentation of lectures,</p><p>• video lectures.</p><p>From our point of view, the didactic provision of the lecture (DPL) of a certain discipline has the following structure: 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</p><p>• Function of registration Author -course (new course).</p><p>• Function of package title editing (List-content (Lecture title, lecture plan, lecture abstract)).</p><p>• Function of lecture completing with tasks from the collection.</p><p>• Functions of lecture text editing (filling with other materials).</p><p>• Functions of editing of lecture presentation (filling with other materials).</p><p>• 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Functions of the student</head><p>• View of package title and select a lecture.</p><p>• Reading of the full lecture text.</p><p>• Using the presentation. • 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 <ref type="bibr" target="#b0">[1]</ref> 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Instructions for the solution Program text</head><p>Lecturer can choose any element of the structure independently of others. 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Subsystem models of LDM support</head><p>The mathematical model of the LDM support process is a bipartite graph of ratio Task -Topic (Example 1)</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Task</head><p>Topic N N</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 Task Topic 1 N</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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Task</head><p>Topic N 1</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 Task Lecture N 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Support of subsystem for practical classes and laboratory works</head><p>The practical part of the educational process in the disciplines of algorithmization and programming can consist of such forms of classes as</p><formula xml:id="formula_1">• laboratory work, • practical training, • control, • tests.</formula><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 sufficient 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: Ideally, the Task book should contain a sufficient 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 difficult 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 <ref type="bibr">[19]</ref>. 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 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Teacher Student</head><p>Task for solution and message Message of task solving</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">N Т</head><p>For example, at studying disciplines:</p><p>• Workshop in Olympiad programming tasks solving • Computer algebra fundamentals</p><p>The following tasks are considered on the specified topic. Topic: Algorithms for solving elementary algebraic tasks Tasks.</p><p>1. Solving of a system of linear inequalities of one variable with rational coefficients. 2. Search for rational roots of the reduced cubic equation. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Independent activity support. Tests and control</head><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. One of the most effective 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" <ref type="bibr" target="#b1">[2]</ref>.</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 different types of control, it is important to control both declarative knowledge and procedural knowledge. Computer methods for controlling declarative knowledge are sufficiently developed <ref type="bibr" target="#b20">[22]</ref>. In the IMS [23] and SCORM <ref type="bibr" target="#b22">[24]</ref> 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 efforts. Therefore, the construction of computer systems for testing productive knowledge, in particular, in the exact sciences, is an important problem. In <ref type="bibr" target="#b23">[25]</ref>, 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Subsystem of registration and use of new tasks in the Task book</head><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 <ref type="bibr" target="#b19">[21]</ref>. The Learning Tools are directly and feedback related to the Teacher and the Student (figure <ref type="figure" target="#fig_3">2</ref>).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>New EER New EER Learning tools</head><p>Teacher Student 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>EER monitoring EER usage</head><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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusion</head><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 <ref type="bibr" target="#b0">[1]</ref>.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: The learning process model.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>The author (compiler) of the discipline The title of disciplineThe list is the discipline content Name of the lecture Lecture plan Abstract of the lecture Link Full text of the lecture Examples Link Presentation of the lecture Link Video lectures</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head></head><label></label><figDesc>Data structures and ATD algorithmsLists, Queues, Stacks, Trees. Data structures and ATD algorithms Insert, Delete, Find. Sort and search. Algorithms on graphs. Algorithms of computational geometry.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: The subsystem of registration and use of new tasks in Task book.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head></head><label></label><figDesc><ref type="bibr" target="#b2">3</ref>. Calculation of the integral coefficients of a cubic equation by its rational roots (Viet's theorem). 4. Analysis of a cubic equation with integer coefficients for the number of real roots 5. Analysis of a cubic equation with integer coefficients for the existence of roots of multiples of 2. 6. Solution of the reduced quadratic equation with integer coefficients in radicals 7. Solving a linear equation with modules 8. Karatsuba's algorithm of multiplying two polynomials with integer coefficients.</figDesc><table /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">About Electronic Textbook &quot;Mathematical Tasks Programming. First Steps</title>
		<author>
			<persName><forename type="first">M</forename><surname>Lvov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Kravtsov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Shishko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Hniedkova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Chernenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Kozlovsky</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-14841-5_22</idno>
	</analytic>
	<monogr>
		<title level="m">ICTERI 2021 Workshops</title>
				<editor>
			<persName><forename type="first">O</forename><surname>Ignatenko</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Kharchenko</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Kobets</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Kravtsov</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Y</forename><surname>Tarasich</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Ermolayev</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Esteban</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Yakovyna</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Spivakovsky</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="334" to="349" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Mathematical Tasks Programming</title>
		<author>
			<persName><forename type="first">M</forename><surname>Lvov</surname></persName>
		</author>
		<ptr target="http://dls.ksu.ks.ua/dls/Library/LibdocView.aspx?id=dcb175b1-7ac0-4cb8-b97a-5448a2fca0f7" />
	</analytic>
	<monogr>
		<title level="m">Initial Steps</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">The Art of Computer Programming</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">E</forename><surname>Knuth</surname></persName>
		</author>
		<ptr target=".pdf" />
	</analytic>
	<monogr>
		<title level="m">Fundamental Algorithms</title>
				<imprint>
			<publisher>Addison-Wesley</publisher>
			<date type="published" when="1997-07">1997. -07-17%5D</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="20" to="25B" />
		</imprint>
	</monogr>
	<note>3 ed</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">The Art of Computer Programming</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">E</forename><surname>Knuth</surname></persName>
		</author>
		<ptr target="https://doc.lagout.org/science/0_Computer%20Science/2_Algorithms/The%20Art%20of%20Computer%20Programming%20%28vol.%202_%20Seminumerical%20Algorithms%29%20%283rd%20ed.%29%20%5BKnuth%201997-11-14%5D.pdf" />
	</analytic>
	<monogr>
		<title level="m">Seminumerical Algorithms</title>
				<imprint>
			<publisher>Addison-Wesley</publisher>
			<date type="published" when="1997">1997</date>
			<biblScope unit="volume">2</biblScope>
		</imprint>
	</monogr>
	<note>3 ed</note>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<title level="m" type="main">A Discipline of Programming</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">W</forename><surname>Dijkstra</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1976">1976</date>
			<publisher>Prentice-Hall, Inc</publisher>
			<biblScope unit="volume">613924118</biblScope>
			<pubPlace>Englewood Cliffs, NJ</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">Programmimg Pearls</title>
		<author>
			<persName><forename type="first">J</forename><surname>Bentley</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1999">1999</date>
			<publisher>Addison-Wesley Professional</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<title level="m" type="main">Concrete mathematics: a foundation for computer science</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">L</forename><surname>Graham</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">E</forename><surname>Knuth</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Patashnik</surname></persName>
		</author>
		<ptr target="https://doc.lagout.org/science/0_Computer%20Science/3_Theory/Mathematics/Concrete%20Mathematics.pdf" />
		<imprint>
			<date type="published" when="1994">1994</date>
			<publisher>Addison-Wesley Professional</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<author>
			<persName><forename type="first">N</forename><surname>Wirth</surname></persName>
		</author>
		<ptr target="http://www.ethoberon.ethz.ch/WirthPubl/AD.pdf" />
		<title level="m">Algorithms and Data Structures (Oberon version)</title>
				<imprint>
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">H</forename><surname>Cormen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">E</forename><surname>Leiserson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">L</forename><surname>Rivest</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Stein</surname></persName>
		</author>
		<ptr target=".MIT.Press.9780262046305.EBooksWorld.ir.pdf" />
		<title level="m">Introduction to Algorithms</title>
				<editor>
			<persName><surname>Leiserson</surname></persName>
		</editor>
		<editor>
			<persName><surname>Stein</surname></persName>
		</editor>
		<editor>
			<persName><surname>Rivest</surname></persName>
		</editor>
		<editor>
			<persName><surname>Cormen</surname></persName>
		</editor>
		<meeting><address><addrLine>Cambridge, Massachusetts and London, England</addrLine></address></meeting>
		<imprint>
			<publisher>The MIT Press</publisher>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
	<note>4 ed</note>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<title level="m" type="main">Elements of Computer Algebra With Applications</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Akritas</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1989">1989</date>
			<publisher>John Wiley &amp; Sons, Inc</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<author>
			<persName><forename type="first">P</forename><surname>Naudin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Quitté</surname></persName>
		</author>
		<title level="m">Algorithmique algébrique avec exercices corrigés</title>
				<imprint>
			<publisher>Dunod</publisher>
			<date type="published" when="1992">1992</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Davenport</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Siret</surname></persName>
		</author>
		<author>
			<persName><forename type="first">É</forename><surname>Tournier</surname></persName>
		</author>
		<title level="m">Computer Algebra: Systems and Algorithms for Algebraic Computation</title>
				<imprint>
			<publisher>Academic Press Ltd</publisher>
			<date type="published" when="1988">1988</date>
		</imprint>
	</monogr>
	<note>2 ed</note>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">P</forename><surname>Dyakonov</surname></persName>
		</author>
		<title level="m">Mathematica 4.1 / 4.2 / 5.0 in mathematical and scientific-technical calculations</title>
				<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<publisher>SOLON-Press</publisher>
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">P</forename><surname>Dyakonov</surname></persName>
		</author>
		<title level="m">Maple 9 in mathematics, physics and education</title>
				<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<publisher>SOLON-Press</publisher>
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<monogr>
		<title level="m" type="main">Computer algebra systems: Maple: The art of programming</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">Z</forename><surname>Aladjev</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">O</forename><surname>Herasymchuk</surname></persName>
		</author>
		<ptr target="http://vvman.lutsk.ua/file/k60.pdf" />
		<title level="m">Rozviazannia olimpiadnykh zadach z prohramuvannia (navchalnyi posibnyk dlia slukhachiv viddilennia kompiuternykh nauk MAN): navch. posib. dlia slukhachiv sektsii viddilennia kompiuternykh nauk</title>
				<meeting><address><addrLine>MAN, Lutsk</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Hurzhii</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">V</forename><surname>Bondarenko</surname></persName>
		</author>
		<title level="m">Rekomendatsii do rozviazuvannia zadach Mizhnarodnykh i Vseukrainskykh olimpiad sered uchniv : navchalno-memodychnyi posibnyk</title>
				<meeting><address><addrLine>Kyiv</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Lvov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">V</forename><surname>Spivakovskyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">V</forename><surname>Zaitseva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">M</forename><surname>Kravtsov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Kot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">H</forename><surname>Kravtsov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">S</forename><surname>Herasymenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">S</forename><surname>Peschanenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Y</forename><surname>Hrabovskyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">O</forename><surname>Khoruzhenko</surname></persName>
		</author>
		<ptr target="https://www.kspu.edu/About/DepartmentAndServices/DigitalInfrastructure/internationalprojects/NationalProjects/Videointerpreter_algorithms_for_search_n_sorting.aspx?lang=uk" />
		<title level="m">Prohramno-metodychnyi kompleks &quot;Videointerpretator alhorytmiv poshuku ta sortuvannia</title>
				<imprint>
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
	<note>Videointerpretator</note>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Resource of training &quot;Wiki-document&quot; in system &quot;Kherson Virtual University</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">O</forename><surname>Kozlovskiy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">M</forename><surname>Kravtsov</surname></persName>
		</author>
		<ptr target="https://ite.kspu.edu/index.php/ite/article/view/309" />
	</analytic>
	<monogr>
		<title level="j">Journal of Information Technologies in Education (ITE)</title>
		<imprint>
			<biblScope unit="volume">15</biblScope>
			<biblScope unit="page" from="255" to="262" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Three-Subjective Didactic Model</title>
		<author>
			<persName><forename type="first">A</forename><surname>Spivakovsky</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Petukhova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Spivakovska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Kotkova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Kravtsov</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-03998-5_13</idno>
	</analytic>
	<monogr>
		<title level="m">Information and Communication Technologies in Education, Research, and Industrial Applications</title>
				<editor>
			<persName><forename type="first">V</forename><surname>Ermolayev</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><forename type="middle">C</forename><surname>Mayr</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Nikitchenko</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Spivakovsky</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><surname>Zholtkevych</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="252" to="273" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Mathematical tests in computer math systems for educational purposes</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Lvov</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Control Systems and Machines</title>
		<imprint>
			<biblScope unit="page" from="60" to="67" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<monogr>
		<title level="m" type="main">Home | 1EdTech</title>
		<ptr target="https://www.1edtech.org/" />
		<imprint>
			<date type="published" when="2024">2024</date>
			<publisher>Consortium, Inc</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<monogr>
		<author>
			<persName><forename type="first">Rustici</forename><surname>Software</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Llc</forename></persName>
		</author>
		<author>
			<persName><forename type="first">Scorm</forename></persName>
		</author>
		<ptr target="https://scorm.com" />
		<title level="m">com HomePage: What is SCORM and How it Works</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">System for Testing Physics Knowledge</title>
		<author>
			<persName><forename type="first">M</forename><surname>Lvov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kuzmenkov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Kravtsov</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-39459-2_9</idno>
	</analytic>
	<monogr>
		<title level="m">Information and Communication Technologies in Education, Research, and Industrial Applications</title>
				<editor>
			<persName><forename type="first">V</forename><surname>Ermolayev</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Mallet</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Yakovyna</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><forename type="middle">C</forename><surname>Mayr</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Spivakovsky</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="186" to="209" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
