Presents an algorithm to compute the critical path in a graph representing a project evaluation research task. Once the algorithm is executed, the last matrix obtained permits the visualization of some important information which leads to the determination of the weight of the critical path. (Author/MM)

An algorithm for the assembly of multiple test forms is proposed in which the multiple-form problem is reduced to a series of computationally less intensive two-form problems. At each step one form is assembled to its true specifications; the other form is a dummy assembled only to maintain a balance between the quality of the current form and the…

The general algorithm used in most hand calculators to approximate elementary functions is discussed. Comments on tabular function values and on computer function evaluation are given first; then the CORDIC (Coordinate Rotation Digital Computer) scheme is described. (MNS)

Discussion of student modeling and intelligent tutoring systems focuses on the development of the ASSERT algorithm (Acquiring Stereotypical Student Errors by Refining Theories). Topics include overlay modeling; bug libraries (databases of student misconceptions); dynamic modeling; refinement-based modeling; and experimental results from tests at…

Analysis of (n=92) university students' construction of visual representations (Venn diagrams) of eight set expressions found competent and error-prone students constructed and used procedures to complete set translation tasks, and two-thirds of observed errors arose from consistent implementation of ill-formed procedures. (Author/MKR)

Described are ways that errors of magnitude can be unwittingly caused when using various supercalculator algorithms to solve linear systems of equations that are represented by nearly singular matrices. Precautionary measures for the unwary student are included. (JJK)

Presents an approach for illustrating, on an intuitive level, the significance of loop invariants for algorithm design and analysis. The illustration is based on mathematical games that require the exploration of regularities via problem-solving heuristics. (Author/MM)

The relative effectiveness of three methods of teaching fraction computation in the context of the community college was investigated. The use of calculators was a special focus of the study. The three methods were: (1) conventional algorithms with no calculator, (2) conventional algorithms with calculator, and (3) alternative algorithms using…

The calculator is used to solve certain formidable equations, which arise naturally and which may be difficult or impossible to solve by standard methods, by a method of successive approximations. (MP)

A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)

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)

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)

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)