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 new least-squares algorithms that update a fit after each point is entered so trends can be detected promptly as an experiment proceeds. (MLH)

Presents compact algorithms, suitable for use with hand held calculators, for the calculation of potentiometric titration curves. (SL)

Presents an exact equation for calculating the volume of titrant as a function of the hydrogen ion concentration suitable for calculation on a hand held calculator. (SL)

Studies the relationship between Eulerian and Lagrangian coordinate systems with the help of computer plots of variables such as density and particle displacement. Gives examples which illustrate the differences in the shape of a traveling wave as seen by observers in the two systems. (Author/GA)

A visual problem-solving technique applicable to several different classes of mechanics time-dependent problems is discussed. The computer is used to solve the equations of motion of various mechanical systems by one of several standard methods, and the solutions are displayed in time increments. A specific example is provided to illustrate this…

Ninety students in an introductory chemistry class were divided into three groups to test the power of algorithms to increase logical thinking abilities. The experimental group received approximately 10 hours of laboratory instruction based on the use of procedural algorithms. Experiment and control groups were tested for logical thinking…

Presents the historical development of perceptions and applications of the exponential law, tracing it from its ancient origins until the year 1900. Shows that many concepts such as mean life and half life and their relationships to differential equations were known long before their application to nuclear radioactivity. (GA)

Explains how a simple three-step algorithm can aid college students in solving synapse transmission problems. Reports that all of the students did not completely understand the algorithm. However, many learn a simple working model of synaptic transmission and understand why an impulse will pass across a synapse quantitatively. Students also see…

Presents a computational method based on a Monte Carlo generation of a large number of chemical reactions. The reactions are allowed to proceed on the basis of relative probabilities. (MLH)

Defines all recurrence relations used in the Nuffield course, to solve first- and second-order differential equations, and describes a typical algorithm for computer generation of solutions. (Author/GA)

Describes an algorithm that provides more rapid convergence for more complicated forms of phase separation requiring the use of a digital computer. Demonstrates that this "inside-out" algorithm remains efficient for determination of the equilibrium states for any type of phase transition for a binary system. (CW)

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)