The term Chisanbop is the trademark for the finger calculation method originally developed by a Korean, Sung Jin Pai. It was refined and simplified by his son, Hang Young Pai, who introduced the technique to the United States in 1976. This annotated bibliography has been organized in five categories. Readings in the first category, Historical…

INSTRUCTIONAL MATERIALS IN MATHEMATICS WERE DEVELOPED ACCORDING TO DESIRED BEHAVIORAL OUTCOMES AND DEMONSTRATED AT A SUMMER, INSERVICE TEACHER EDUCATION PROGRAM. PROJECT STAFF MEMBERS WERE PRESENTED WITH AN AUDIOVISUAL AND SUPPLEMENTAL READING PROGRAM TO ORIENT THEM TO A BEHAVIORAL OUTCOME APPROACH TO INSTRUCTION. BEFORE THE INSTRUCTIONAL…

Forty-five children aged four-and-a-half to five-and-a-half years old were given number conservation tasks in three conditions: (1) a count condition in which children were helped to count each set after the transformation; (2) a match condition in which children were helped to connect by a string each animal with its peanut; and (3) the standard…

The so-called discrete approach in calculus instruction involves introducing topics from the calculus of finite differences and finite sums, both for motivation and as useful tools for applications of the calculus. In particular, it provides an ideal setting in which to incorporate computers into calculus courses. This approach has been…

The "modern mathematics" curriculum places considerably more emphasis on the use of precise terminology when referring to properties of whole numbers than did previous curricula. The relationship between the ability to make these verbal associations and other aspects of mathematics achievement of sixth graders is investigated in this study A…

Response time in large, inverted file document retrieval systems is determined by time required to access files of document identifiers on disk and process a Boolean search request. A specialized computer system has been devised that can perform a complicated sample search involving 70 terms and over 60,000 document references 12 to 60 times…

Chapter I, an introduction to machine translation of languages, contains a simplified description of electronic computing machines, and a discussion of the advantages and disadvantages of machine translation research. A historical background of machine translation of languages is given, together with a description of various machine translation…

This study defined a type of information-processing task analysis and an index relating different instructional sequences to this analysis. One hundred sixty-four college students were taught, with computer-assisted instruction, an imaginary science by various instructional sequences or by selecting their own sequence. A program-controlled…

Several computer programs were developed to solve various versions of the quadratic capacitated facilities location problem. Matrices, which represent various business costs, are defined for the factors of sites, facilities, customers, commodities, and production units. The objective of the program is to find an optimization matrix for the lowest…

The purpose of this project was to determine if the method of subtraction of integers taught to seventh grade students affected their mathematics achievement or retention. Computation, concept, and problem-solving sections of the California Achievement Test were given as pretests and posttests. An investigator-constructed test of the addition and…

Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)

Examines similarities between composition and programming processes, and reviews two studies that linked instruction in computer programming and freshman composition to help students understand writing as a design discipline. Projects at the University of Montana and Bryn Mawr College which improved students' writing abilities are described. (LRW)

Discusses the differences between problems and exercises in chemistry, and some of the difficulties that arise when the same methods are used to solve both. Proposes that algorithms are excellent models for solving exercises. Argues that algorithms not be used for solving problems. (TW)

Discusses the difference between a generic chemistry problem (one which can be solved using an algorithm) and a harder chemistry problem (one for which there is no algorithm). Encourages teachers to help students recognize these categories of problems so they will be better able to find solutions. (TW)

Discusses the differences between problems and exercises, the levels of thinking required to solve them, and the roles that algorithms can play in helping chemistry students perform these tasks. Proposes that students be taught the logic of algorithms, their characteristics, and how to invent their own algorithms. (TW)