Forms of applıcatıon of algorıthms ın school mathematıcs teachıng

As for the qualitative definition of the theoretical structure of the concept of algorithm, obtained by building a system of its study on the basis of component analysis in the article, it should be completed by studying the types of algorithmic processes. Three common types of such processes (linea...

Full description

Bibliographic Details
Main Author: Kamala Gaybaliyeva Yunis
Format: Article
Language:English
Published: State institution “South Ukrainian National Pedagogical University named after K D. Ushynsky” 2021-06-01
Series:Науковий Вісник Південноукраїнського Національного Педагогічного Університету імені К. Д. Ушинського
Subjects:
Online Access:https://drive.google.com/file/d/1bTPDANI-1goHYuRwQAYjHEkt8jnXUf-D/view
_version_ 1827882956803276800
author Kamala Gaybaliyeva Yunis
author_facet Kamala Gaybaliyeva Yunis
author_sort Kamala Gaybaliyeva Yunis
collection DOAJ
description As for the qualitative definition of the theoretical structure of the concept of algorithm, obtained by building a system of its study on the basis of component analysis in the article, it should be completed by studying the types of algorithmic processes. Three common types of such processes (linear, branching and recursive) play a slightly different role here. The first two types are somewhat simple, as we tried to show in Example 1, it would be natural to use them in the study of the components of the algorithm. Recursive processes can be applied to the play of already separated concepts. There are plenty of examples in various sections of Algebra, such as the "sequences" section, in particular. Finding the approximate value of an expression using the Heron formula can be a good example of recursive processes. The purpose of the research is to develop a methodological system that identifies opportunities to improve the quality of integrated mathematics teaching in V-IX grades and connect it with computer technology as well as identifies ways to apply it in the learning process. Textbooks often show the performance of a particular action on a few specific examples. We come across different situations here. Sometimes the rule is stated after the solution of the work, and sometimes the work is considered after the expression of the rule. The third case is possible, there is no definition of the rule in the textbook, but specific examples of the application of the formed algorithm are considered. This is quite common in school textbooks, especially when considering complex algorithms. In such cases, it is accepted to call the solutions of the studies as examples. The sample solution must meet certain requirements. Let's separate some of them from the point of view of the formed algorithm: the most characteristic cases of the considered type of problem should be considered; numerical data should be selected in such a way that the necessary calculations can be performed orally in order to draw students' attention to the sequence of elementary operations that make up the steps of the formed algorithm. If the problem-solving example meets these requirements, then the type of problem assigned to it can be considered as an algorithm for solving the problem. If, depending on the initial data, there are several fundamentally different cases of problem solving, it is necessary to consider examples of problem solving for each such case.
first_indexed 2024-03-12T19:04:41Z
format Article
id doaj.art-de142174beb243ef954216dcff2e794a
institution Directory Open Access Journal
issn 2414-5076
2617-6688
language English
last_indexed 2024-03-12T19:04:41Z
publishDate 2021-06-01
publisher State institution “South Ukrainian National Pedagogical University named after K D. Ushynsky”
record_format Article
series Науковий Вісник Південноукраїнського Національного Педагогічного Університету імені К. Д. Ушинського
spelling doaj.art-de142174beb243ef954216dcff2e794a2023-08-02T06:20:55ZengState institution “South Ukrainian National Pedagogical University named after K D. Ushynsky”Науковий Вісник Південноукраїнського Національного Педагогічного Університету імені К. Д. Ушинського2414-50762617-66882021-06-011352712https://doi.org/10.24195/2617-6688-2021-2-1Forms of applıcatıon of algorıthms ın school mathematıcs teachıngKamala Gaybaliyeva Yunis 0https://orcid.org/0000-0001-8336-1773Senior Lecturer of the "General Mathematics" Department of Ganja State University, PhD student As for the qualitative definition of the theoretical structure of the concept of algorithm, obtained by building a system of its study on the basis of component analysis in the article, it should be completed by studying the types of algorithmic processes. Three common types of such processes (linear, branching and recursive) play a slightly different role here. The first two types are somewhat simple, as we tried to show in Example 1, it would be natural to use them in the study of the components of the algorithm. Recursive processes can be applied to the play of already separated concepts. There are plenty of examples in various sections of Algebra, such as the "sequences" section, in particular. Finding the approximate value of an expression using the Heron formula can be a good example of recursive processes. The purpose of the research is to develop a methodological system that identifies opportunities to improve the quality of integrated mathematics teaching in V-IX grades and connect it with computer technology as well as identifies ways to apply it in the learning process. Textbooks often show the performance of a particular action on a few specific examples. We come across different situations here. Sometimes the rule is stated after the solution of the work, and sometimes the work is considered after the expression of the rule. The third case is possible, there is no definition of the rule in the textbook, but specific examples of the application of the formed algorithm are considered. This is quite common in school textbooks, especially when considering complex algorithms. In such cases, it is accepted to call the solutions of the studies as examples. The sample solution must meet certain requirements. Let's separate some of them from the point of view of the formed algorithm: the most characteristic cases of the considered type of problem should be considered; numerical data should be selected in such a way that the necessary calculations can be performed orally in order to draw students' attention to the sequence of elementary operations that make up the steps of the formed algorithm. If the problem-solving example meets these requirements, then the type of problem assigned to it can be considered as an algorithm for solving the problem. If, depending on the initial data, there are several fundamentally different cases of problem solving, it is necessary to consider examples of problem solving for each such case. https://drive.google.com/file/d/1bTPDANI-1goHYuRwQAYjHEkt8jnXUf-D/viewalgorithmic culturealgorithmic descriptive languagesblock diagramsequationstablesalgebra textbooks
spellingShingle Kamala Gaybaliyeva Yunis
Forms of applıcatıon of algorıthms ın school mathematıcs teachıng
Науковий Вісник Південноукраїнського Національного Педагогічного Університету імені К. Д. Ушинського
algorithmic culture
algorithmic descriptive languages
block diagrams
equations
tables
algebra textbooks
title Forms of applıcatıon of algorıthms ın school mathematıcs teachıng
title_full Forms of applıcatıon of algorıthms ın school mathematıcs teachıng
title_fullStr Forms of applıcatıon of algorıthms ın school mathematıcs teachıng
title_full_unstemmed Forms of applıcatıon of algorıthms ın school mathematıcs teachıng
title_short Forms of applıcatıon of algorıthms ın school mathematıcs teachıng
title_sort forms of application of algorithms in school mathematics teaching
topic algorithmic culture
algorithmic descriptive languages
block diagrams
equations
tables
algebra textbooks
url https://drive.google.com/file/d/1bTPDANI-1goHYuRwQAYjHEkt8jnXUf-D/view
work_keys_str_mv AT kamalagaybaliyevayunis formsofapplıcatıonofalgorıthmsınschoolmathematıcsteachıng