Describes basic structure of a framegame, Chain Gang, in which self-instructional modules teach a cognitive skill. Procedures are presented for loading new content into the game's basic framework to teach algorithms or heuristics and for game modification to suit different situations. Handouts used in the basic game are appended. (MBR)

An attempt is made to show that algebra is rarely obvious, and merely expecting children to learn rules is an oversimplification. Sections cover: (1) The Non-visual Nature of Algebra; (2) The Apparently Arbitrary Nature of Algebra; (3) The Relationship Between Symbolism, System and Question; (4) The Complex Nature of Algebra; and (5) Some…

Some concrete examples of the use of historical materials in developing certain topics from precalculus and calculus are presented. Ideas which can be introduced with a reformulated curriculum are discussed in five areas: algorithms, combinatorics, logarithms, trigonometry, and mathematical models. (MNS)

Discusses computer methods for finding roots of polynomials. The program provided finds rational roots and prints the roots as rational numbers. (PK)

Shows by means of a mathematical example how algorithmic thinking and mathematical thinking complement each other. An algorithmic approach can lead to questions that deepen the understanding of mathematics material. (DDR)

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)