Automated teaching system ``Sets'' (research for organizing the 1st part of the project)

V. S. Rublev ; M. D. Kondakov

Modelirovanie i analiz informacionnyh sistem, Tome 28 (2021) no. 1, pp. 90-103.

Résumé

The issues of building an automated learning system “Sets” which will allow students to master one of the important topics of the discipline “Discrete Mathematics” and to develop logical and mathematical thinking in this direction are studied. The corresponding topic of the 1st part of the project includes materials related to the concept of a set, operations on sets, algebra of sets, proofs of statements for sets, and the derivation of formulas for the number of set elements. The system is based on a construction of the statements proof editor for a set and of the formulas derivation editor for the number of set elements, both editors are to be used for teaching. The first of these allows students to split the original statement into a number of simpler statements, taken together equivalent to the original statement, to choose a method of proving each simple statement and to conduct their step-by-step proof. The second editor allows (using the inclusion-exclusion principle and the formula of the number of complement elements) to derive a step-by-step formula for the number of set elements through the specified numbers of elements for sets from which the resulting set is constructed. An important part of the system is to monitor the correctness of all actions of students, and on this basis the entire learning system is developed. The logical supervision over the correctness of the selected action in the first editor is performed by a Boolean function created by the system and corresponding to this action and by checking it for identical truth. In the second editor, invariants such as characteristic strings of the set and of its number of elements are used for verification. The rest of the system is related to learning of set algebra and to preparation to editors usage. The main focus here is on the learning strategy in which testing the understanding of the learned material is rather rigorous and eliminating the random choice of answers. The division of the material into sections with verification of the success of teaching not only by tests, but also by exercises and tasks, allows students to master the complex logical and mathematical techniques of proving statements for sets and derivation of formulas for the number of set elements.

Détail

Keywords: computer learning, discrete sets, set algebra, statements for sets, step-by-step proof, number of set elements, formula derivation, correctness control.

Bibliographie

[1] A. Büchner, Moodle 3 administration, Third edition, Packt Publishing, 2016

[2] S. K. Udaya, T. V. Vamsi Krishna, “E-learning: technological development in teaching for school kids”, International Journal of Computer Science and Information Technologies, 5:5 (2014), 6124–6126

[3] M. Kerres, D. Meister, F. von Gross, U. Sander, Enzyklopädie Erziehungswissenschaft, 2012

[4] S. Clark, J. Baggaley, “Assistive software for disabled learners”, The International Review of Research in Open and Distributed Learning, 5:3 (2004) | DOI

[5] A. Nagy, “The impact of E-learning”, E-content: technologies and perspectives for the european market, Springer-Verlag, Berlin, 2005, 79–96 | DOI

[6] I. E. Allen, J. Seaman, Changing course: ten years of tracking online education in the united states, Babson Survey Research Group, 2013

[7] D. Burgos et al. (eds.), “Higher education learning methodologies and technologies online”, First international workshop, HELMeTO 2019 (Novedrate, CO, Italy, June 6–7, 2019), Springer, 2019, 6–7

[8] A. Holzinger et al. (eds.), International cross-domain conference for machine learning and knowledge extraction, Springer, 2019

[9] Y. Zhang, D. Cristol, Handbook of mobile teaching and learning, Springer, 2019

[10] S. Kong, H. Abelson, Computational thinking education, Springer Nature, 2019

[11] G. Hanna, D. Reid, M. de Villiers, Proof technology in mathematics research and teaching, Springer, 2019 | Zbl

[12] M. England and other (eds.), 21st international workshop CASC 2019, Springer

[13] J. H. Davenport, Y. Siret, E. Tournier, Computer algebra: systems and algorithms for algebraic computation, Academic Press, 1988 | MR | Zbl

[14] J. Gathen, J. Gerhard, Modern computer algebra, Cambridge University Press, 2013 | MR | Zbl

[15] V. B. Taranchuk, The main functions of computer algebra systems, BSU, Minsk, 2013 (in Russian)

[16] A. V. Ermilova, V. S. Rublev, “Problems of mathematical thinking development for students basing on example of teaching system to the course "algorithms and computational complexity analysis’’”, Proceedings of IX international theoretical and practical conference Information Technologies and IT-education, INTUIT.RU, M., 2014, 297–304 (in Russian)

[17] V. S. Rublev, M. T. Yusufov, “Automated system for teaching computational complexity analysis of algorithms”, Modern Information Technologies and IT-Education, 12:1 (2016), 135–145 (in Russian)

[18] V. S. Rublev, M. T. Yusufov, “Automated teaching system “analysis of algorithms computational complexity” (research for organizing the 1st part of the project)”, Modern Information Technologies and IT-Education, 13:2 (2017), 170–178 (in Russian)

[19] V. S. Rublev, M. T. Yusufov, “Automated system for teaching computational complexity of algorithms course”, Modeling and Analysis of Information Systems, 24:4 (2017), 481–495 (in Russian) | DOI

[20] V. S. Rublev, M. T. Yusufov, “Models for teaching analysis of algorithm computational complexity”, 3rd international on computer algebra and information technologies (2018, August 20–25), ONSU, Odessa, 2018, 157–160 (in Russian)

[21] V. S. Rublev, D. R. Vakhmyanin, “Automated system for teaching «proof of statements for sets»”, Modern Information Technologies and IT-Education, 15:4 (2019), 1014–1027 (in Russian)

[22] V. S. Rublev, Boolean functions (individual work #4 and #5 for the course “discrete mathematics”), YSU, Yaroslavl, 2018

[23] V. S. Rublev, Sets (individual work #1 for the course “discrete mathematics”), YSU, Yaroslavl, 2018