The Euclidean Discus Toss is an active and tactile learning activity that models the extended Euclidean algorithm with a frisbee relay. The extended Euclidean algorithm involves both iterative and recursive programming and is regularly taught throughout the mathematics and computer science curricula. The Euclidean Discus Toss invites students to…

Proposes a criterion for selecting a sequence of objectives from a learning hierarchy and describes a sequence generating algorithm which is designed to generate a minimal memory load sequence from a learning tree. Its effectiveness in generating low memory load sequences from hierarchies that are not trees is also discussed. (RP)

Describes NEGOTIATE, an interactive computer model that synthesizes bargaining theories into algorithmic functions capable of simulating complex labor relations. The models employed in the simulation, the instructional dimension of NEGOTIATE, and various applications of the game are discussed. A seven-item reference list is included. (Author/JL)

A continuum of item-writing methods is proposed ranging from informal-subjective methods to algorithmic-objective methods. Examples of techniques include objective-based item writing, amplified objectives, item forms, facet design, domain-referenced concept testing, and computerized techniques. (Author/CP)