Search

Search Results

• Promoting a meaningful learning of double integrals through routes of digital tasks

  107-134

  Francesca Alessio

  Lucio Demeio

  Agnese Ilaria Telloni

  Views:

  179

  Within a wider project aimed at innovating the teaching of mathematics for freshmen, in this study we describe the design and the implementation of two routes of digital tasks aimed at fostering students' approach to double integrals. The tasks are built on a formative assessment frame and classical works on problem solving. They provide facilitative and response-specific feedback and the possibility to request different hints. In this way, students may be guided to the development of well-connected knowledge, operative and decision-making skills. We investigated the effects of the interaction with the digital tasks on the learning of engineering freshmen, by comparing the behaviours of students who worked with the digital tasks (experimental group, N=19) and students who did not (control group, N=19). We detected that students in the experimental group showed more exibility of thinking and obtained better results in the final exam than students in the control group. The results confirmed the effectiveness of the experimental educational path and offered us interesting indications for further studies.

  Subject Classification: 97D40, 97U70, 44A45

• Teaching graph algorithms with Visage

  35-50

  Andreas Fest

  Ulrich Kortenkamp

  Views:

  27

  Combinatorial optimization is a substantial pool for teaching authentic mathematics. Studying topics in combinatorial optimization practice different mathematical skills, and because of this have been integrated into the new Berlin curriculum for secondary schools. In addition, teachers are encouraged to use adequate teaching software. The presented software package "Visage" is a visualization tool for graph algorithms. Using the intuitive user interface of an interactive geometry system (Cinderella), graphs and networks can be drawn very easily and different textbook algorithms can be visualized on the graphs. An authoring tool for interactive worksheets and the usage of the build-in programming interface offer new ways for teaching graphs and algorithms in a classroom.

• 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:

  36

  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.