Study and use of recursive algorithms in computer science teacher training

The article substantiates the importance of studying recursion by students of the 44.03.05 Pedagogical education profile of Informatics, as well as by students of the second and ninth enlarged groups associated with IT areas. The works of Esayan A.R. are analyzed, which form the methodological and theoretical basis for teaching students of the Tula State Pedagogical University in the field of construction and use of recursive algorithms. An overview of current research in the field of the formation and development of the mathematical culture of future teachers and specialists in IT areas through the study of recursion, methodological features of the study of recursive algorithms as the basis for the development of the worldview and
research skills of students, examples of the effectiveness of the use of recursive constructions and functions in solving practice-oriented tasks.
The authors describe the logic of studying the basics of recursion, the principles for selecting the content necessary for the study of this topic by future teachers and specialists in IT areas.
The proposed content of the classes is based not only on the theoretical study of the basic concepts of this subject area, but also on the consideration of convincing irrefutable evidence of the existence and beauty of recursive objects of various nature. The study of practical material is proposed to be built in accordance with the didactic principle "from simple to complex": from the simplest recursive algorithms for perception to efficient sorting and search
algorithms on dynamic data structures. This approach, according to the authors, allows students to evaluate the significance and effectiveness of recursive methods of information processing and
form professional competencies in the development and application of optimal algorithms for solving practice-oriented problems.

1. Knut D. E., 2007, The Art of Programming / Translated from English; under total ed. Yu. V.

2. Kozachenko. Moscow: Williams, 712 p.

3. Esayan A. R., 2001, “Teaching algorithmization based on recursion: textbook. allowance for

4. students ped. universities.” Tula: Publishing house of TSPU im. L. N. Tolstoy, 215 p.

5. Esayan A. R., 2001, Theory and methods of teaching algorithmization based on recursion in

6. the course of informatics of a pedagogical university: dis. ... Dr. ped. Sciences: 13.00.02 - theory

7. and methodology of training and education (by areas and levels of education) Tula, 363 p.

8. Esayan A. R., 2000, “Knowledge, skills and abilities related to recursion.” // Pedagogy as

9. a science and as a subject: abstract. reports of inter-dun. scientific-practical conf. - Tula:

10. publishing house of the TSPU named after. L. N. Tolstoy, - P. 100-104.

11. Esayan A. R., 1998, “Recursion as a general educational value” // Education as a value: Sat.

12. scientific tr. graduate students and doctoral students. Tula: publishing house of TSPU im. L.N.

13. Tolstoy, pp. 21-35.

14. Esayan A. R., 2000, “Solving problems using recursion” // Modern problems of mathematics,

15. mechanics, informatics: abstracts of the All-Russian Scientific Conference. - Tula: publishing

16. house of TulGU, pp. 140-141.

17. Dobrovolskaya N. Yu., Gumerov A. E., 2017, “The study of recursive algorithms using the

18. research method” // Tasks in teaching mathematics, physics and informatics: theory, experience,

19. innovations: materials of the II International scientific and practical conference dedicated to the

20. th anniversary of P. A. Larichev. - Vologda: publishing house: IP Kiselev A. V., P.317-319

21. Machkova N. V., 2016, “Developmental learning and recursion” // II International Research

22. Conference on Informatics and Information and Communication Technologies “INFO-expert”:

23. collection of research papers. - Yelets: Foundation for the Promotion of the Development of

24. Internet Media, IT Education, Human Potential “Internet Media League”. - pp. 83-87.

25. Mirzoev M. S., 2008, “Interdisciplinary connections of mathematical disciplines with informatics

26. as the basis for the formation of the mathematical culture of the future teacher of informatics”

27. // Lecturer XXI century, № . 3. pp. 7-15.

28. Mirzoev M. S., 2007, “Recursive method as a basis for the formation and development of the

29. mathematical culture of future informatics teachers” // Science and School, № 1. pp. 33-35.

30. Madudin V. N., Morozova E. V., Safronova I. V., 2020, “Features of the content of mathematical

31. disciplines in the preparation of bachelors of applied informatics” // Bachelor of applied

32. informatics: the practice of implementing the main educational program: monograph. -

33. Chelyabinsk: Ural State University of Physical Culture, pp.109-115.

34. Sergeev R. S., 2021, “Recursion as a phenomenon of modeling objects and phenomena of the

35. real world” // Engineering thought: collection of reports of the V City scientific and practical

36. conference dedicated to the year of science and technology. - Kazan: Kazan State Technical

37. University. A.N. Tupolev, pp. 83-85.

38. Zhukov A. O., 2020, “Predicting the spread of COVID-19 based on recursive models” //

39. European Scientific Conference: collection of articles of the XX International Scientific and

40. Practical Conference. - Penza: Science and Education, pp.45-48.

41. Esayan A. R., 2001, “Learning algorithmization based on recursion: Proc. allowance for students

42. ped. universities.” - Tula: Publishing House of the TSPU named after. L. N. Tolstoy, 216 p.

43. Esayan A. R., 2000, “Recursion in Informatics: A textbook for students of pedagogical

44. universities: In 4 parts”, Tula: publishing house of the TSPU. L. N. Tolstoy.