Describes a fast algorithm for comparing the lists of terms representing documents in automatic classification experiments. Complexity and running time for the algorithm are compared to other procedures, and a short algol-like routine is presented in the appendix. Eight references are included. (Author/BK)

Alternative algorithms, "tricks," and shortcuts are viewed as ideally suited for inclusion in a systematic program of practice because of their motivational effect and the mental stimulation involved in discovering why they work. (MP)

Each of the hand-held calculator logic systems found on the market today is introduced, along with some of the advantages and disadvantages of each. The systems reviewed are: arithmetic logic, algebraic logic-no hierarchy, algebraic operating system, and reverse polish notation. (MP)

Student weaknesses on problem-solving portions of the NAEP mathematics assessment are discussed using Polya's heuristics as a framework. Recommendations for classroom instruction are discussed. (MP) Aspect of National Assessment (NAEP) dealt with in this document: Results (Interpretation).

The formula used by the telephone company to determine long distance charges is presented and several sample problems are included. (MP)

Describes an activity whose objectives are to encode and decode messages using linear functions and their inverses; to use modular arithmetic, including use of the reciprocal for simple equation solving; to analyze patterns and make and test conjectures; to communicate procedures and algorithms; and to use problem-solving strategies. (ASK)

The authors are conducting a study of instructors teaching data structure and algorithm topics, with a focus on the use of diagrams and tracing. The results of this study are being used to inform the design of the Support Kit for Animation (SKA). This article describes a preliminary version of SKA, and possible usage scenarios. (Author/AEF)

Presents an easy method for constructing magic squares from three-by-three to general squares. Provides a computer program generating odd-order magic squares. Six references are listed. (YP)

This study assessed the extent to which procedurally proficient children (N=34) construct the part/whole logical structure that underlies the borrowing algorithm in subtraction. Results indicate that an understanding of the part/whole logic of number may be necessary to understand place value and borrowing. (TJH)

Covariance structures associated with linear structural equation models are discussed. Algorithms for computing maximum likelihood estimates (namely, the EM algorithm) are reviewed. An example of using likelihood ratio tests based on complete and incomplete data to improve the fit of a model is given. (SLD)

Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…

Describes an algorithm for computer generation of hierarchical indexes for document collections. The resulting index, when presented with a graphical interface, provides users with a view of a document collection that permits general browsing and informal search activities via an access method that requires no keyboard entry or prior knowledge of…

Presents cooperative computing activities in which each student plays the role of a switch or processor and acts out algorithms. Includes binary counting, finding the smallest card in a deck, sorting by selection and merging, adding and multiplying large numbers, and sieving for primes. (16 references) (Author/MKR)

Discusses using what students already know about taking away objects when teaching subtraction and gives six lessons to develop language for discussing and recording subtraction situations that give meaning to the subtraction algorithm. (MKR)

This paper addresses the problem of data management techniques for efficiently retrieving requested subsets of large data sets from mass storage devices. Describes the development of algorithms and software that facilitate the partitioning of a large data set into multiple "clusters" that reflect their expected access. (Author/JKP)