METHODS OF TEACHING ALGORITHMS AND DATA STRUCTURES
The article is devoted to the methods of teaching students the basic often applied algorithms of solving computer problems. The main feature of this methodology is the consistent study of the basic algorithms (sorting and search, information theory and cryptography, recursive algorithms and graph algorithms) implying the use of any programming language and further implementation of the studied algorithms in practice. This course includes laboratory practical tasks. These tasks have the increasing difficulty. At the beginning of the course a simple task demands from the student filling of admissions. More difficult tasks assume independent development and debugging of computer programs.
Keywords: methods of teaching, algorithmic thinking, algorithms and data structures, sort and search, recursive algorithms and graph algorithms
References:
1. Ilyasov А. N. K voprosu o roli i meste programmirovaniya v shkol’noy informatike [To the question on the role and place of programming in school computer science]. URL: http://www.rusedu.info/PrintArticle101.html (accessed 1.03.2015) (in Russian).
2. Lapchik M. P., Semakin I. G., Henner E. K. Metodika prepоdavaniya informatiki: ucheb. posobiye dlya studentov ped. vuzov [The Technique of teaching of computer science: Study guide for the students of pedagogical higher schools]. Moscow, Akademiya Publ., 2003. 624 p. (in Russian).
3. Yakymenko O. V., Stas A. N. Primeneniye obuchayushchikh programm-trenazherov v obuchenii programmirovaniyu [Use of Computer Tutors in Teaching Programming]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2009, vol. 1 (79), pp. 54–56 (in Russian).
4. Rabochaya programma distsipliny “Algoritmy i struktury dannykh” [The working program of the discipline “Algorithms and data structures”]. URL: http://tspu.edu.ru/images2/fmf_news/UMKD/426/426_Б.3.В.06_Алгоритмы_и_структуры_данных.pdf (accessed 1.03.2015) (in Russian).
5. Stas A. N., Dolganova N. F. Razvitiye algoritmicheskogo myshleniya v protsesse obucheniya budushchikh uchiteley informatiky [Algorithmic thinking development when training computer science teachers]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2012, vol. 7 (122), pp. 241–244 (in Russian).
6. Stas A. N., Prusskikh O. N. Formirovaniye algoritmicheskogo myshleniya v protsesse obucheniya teorii grafov [Shaping the algorithmic thinking in the process of the education graph theory]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2012, vol. 2 (117), pp. 166–169 (in Russian).
7. Stas A. N., Dolganova N. F. O problemakh prepodavaniya vychislitel’noy geometrii v usloviyakh pedagogicheskogo vuza [The problems of computational geometry in the conditions of a pedagogical university]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2007, vol. 6 (69), pp. 112–115 (in Russian).
8. Dolganova N. F., Stas A. N. Osnovnye didakticheskiye printsipy postroeniya distsipliny “Elementy vychislitel’noy geometrii” v usloviyakh pedagogicheskogo vuza [Basic Didactic Principles of Designing the Elements of Computational Geometry Course in Pedagogical Institute of Higher Education]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2009, vol. 1 (79), pp. 56–58 (in Russian).
( 406.14 kB ) 
( 399.96 kB )
Issue: 8, 2015
Series of issue: Issue 8
Rubric: PEDAGOGY OF HIGHER EDUCATION AND ADVANCED TRAINING
Pages: 131 — 134
Downloads: 954