Discusses an algorithm for developing problem solving simulations using microcomputers, and describes both the components of the simulation algorithm and the user interface. Examples of simulation and programming methods are presented. (MBR)

Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (MNS)

How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

A possible method of derivation of prescriptions for solving problems, found in Babylonian cuneiform texts, is presented. It is a kind of "geometric algebra" based mainly on one figure and the manipulation of or within various areas and segments. (MNS)

Computational algorithms from American textbooks copyrighted prior to 1900 are presented--some that convey the concept, some just for special cases, and some just for fun. Algorithms for each operation with whole numbers are presented and analyzed. (MNS)

Built-in data structures are the registers and memory words where binary values are stored; hard-wired algorithms are the fixed rules, embodied in electronic logic circuits, by which stored data are interpreted as instructions to be executed. Various topics related to these two basic elements of every computer program are discussed. (JN)

Shows that the rules of thumb for propagating significant figures through arithmetic calculations frequently yield misleading results. Also describes two procedures for performing this propagation more reliably than the rules of thumb. However, both require considerably more calculational effort than do the rules. (JN)

Presents a modification function for weights of descriptors for documents in fuzzy retrieval systems which includes some desirable properties that are lacking in the model proposed by Choros and Danilowicz in their study on relative indexing. (MBR)

Discusses properties of multiple attribute tree (MAT) and inverted file structures; establishes suitability of MAT data structure for bibliographic files using worst-case performance measures; provides arguments to establish MAT average case superiority; and proposes an efficient adaptation of MAT data structure to exploit special features of MAT…

Describes an algorithm used at the University of Ottawa to create examination schedules that are not only conflict free and minimize number of consecutive examinations for individual students, but provide for the scheduling of certain proper subsets of examinations into proper time slots and minimal overall number of consecutive examinations. (MBR)

How to use the electronic spreadsheet (e.g., VisiCalc) creatively is discussed, with computer printouts for a number of algorithms. (MNS)

Two strategies for assessing item bias are discussed: methods comparing item difficulties unconditional on ability and methods comparing probabilities of response conditional on ability. Results suggest that the iterative logit method is an improvement on the noniterative one and is efficient in detecting biased and unbiased items. (Author/DWH)

Rubin and Thayer recently presented equations to implement maximum likelihood estimation in factor analysis via the EM algorithm. It is argued here that the advantages of using the EM algorithm remain to be demonstrated. (Author/JKS)

The authors respond to a criticism of their earlier article concerning the use of the EM algorithm in maximum likelihood factor analysis. Also included are the comments made by the reviewers of this article. (JKS)

An algorithm is given for computing the cube root of any real number on a calculator. (DT)