Search

Search Results

• CAS as a didactical challenge

  379-393

  Edith Schneider

  Views:

  36

  The paper starts with the discussion of a concept of general mathematics education (mathematics education for everyone). This concept views the focus of teaching mathematics in the reduction of the demands in the field of operative knowledge and skills as well as in an increase of the demands in the fields of basic knowledge and reflection. The consequences of this concept are didactically challenging for the use of Computer Algebra Systems (CAS) in the teaching of mathematics. By reducing the operative work we reduce exactly that field in which the original potential of CAS lies. It is shown that in such maths classes the main focus of CAS is on their use as a pedagogical tool, namely as support for the development of basic knowledge and reflection as well as a model of communication with mathematical experts.

• An interactive animation for learning sorting algorithms: How students reduced the number of comparisons in a sorting algorithm by playing a didactic game

  45-62

  Ladislav Végh

  Veronika Stoffová

  Views:

  42

  Learning programming and understanding algorithms is one of the hardest tasks for novice computer science students. One of the basic algorithms they learn during the introductory programming and algorithms courses are the sorting algorithms. Students like learning these and other algorithms by animations and didactic games, however, these animations are not educationally useful in every case. In this article, we present our educational sorting game, which can be used to introduce the topic of sorting algorithms. The didactic game can be used later too, as a demonstrative tool for explaining the more efficient, quicksort algorithm. We conducted a pedagogical experiment, in which we examined the process of development of sorting algorithms by students while they used the mentioned didactic game. The results showed that students were able to create an algorithm to solve the sorting problem, and they improved its effectiveness by reducing the number of comparisons in the algorithm. They were also able to understand the importance of the efficiency of algorithms when we demonstrated them the quicksort algorithm using the same tool after the experiment.