Premium
Bringing Algorithms to Life: Cooperative Computing Activities Using Students as Processors
Author(s) -
Bachelis Gregory F.,
Maxim Bruce R.,
James David A.,
Stout Quentin F.
Publication year - 1994
Publication title -
school science and mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.135
H-Index - 2
eISSN - 1949-8594
pISSN - 0036-6803
DOI - 10.1111/j.1949-8594.1994.tb15651.x
Subject(s) - sorting , computer science , sorting algorithm , selection (genetic algorithm) , algorithm , prime (order theory) , binary number , parallel computing , theoretical computer science , arithmetic , mathematics , artificial intelligence , combinatorics
The authors describe a method for “bringing algorithms to life” in secondary school mathematics and computer science classes. Cooperative computing activities are presented in which each student plays the role of a switch or processor, and the algorithms are “acted out.” Parallel algorithms, in which many steps can occur at the same time, are emphasized, as they are especially suited for cooperative activities. The activities are grouped together in modules, according to the problems they address. Those presented include binary counting, finding the smallest card in a deck, sorting by selection and merging, adding and multiplying large numbers, sieving for primes, testing whether a number is prime, and sorting using a linear configuration of processors. Detailed descriptions of how to implement the algorithms are given.