Commonly used methods to simulate the oxidation-reduction (redox) titration curves include the three-step method and the rigorous method. The simple three-step method simulates the redox titration curve with the assumption that the reaction is complete, which is widely used in undergraduate quantitative analysis courses. For the rigorous…

Objective/Research Question: Community college graduation rates are typically quite low, and developmental mathematics enrollment and coursetaking patterns may constrain academic outcomes. To identify ways in which community college graduation rates may be improved, decision trees were utilized to examine the STEM coursetaking patterns of N =…

Machine learning models were constructed to predict student performance in an introductory mechanics class at a large land-grant university in the United States using data from 2061 students. Students were classified as either being at risk of failing the course (earning a D or F) or not at risk (earning an A, B, or C). The models focused on…

The methodology and mathematical treatment of several classic multivariate methods for the analysis of spectroscopic data is demonstrated in a straightforward way that can be used as a basis for teaching an undergraduate introductory course on chemometric analysis. The multivariate techniques of classical least-squares (CLS), principal component…

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)

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)

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…

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)

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)

Explains the use of the 3-dimensional analytic geometry method to find values for a field geology problem. Gives a description of the mathematical theory for this method which can be applied to data obtained by drilling as well as open surfaces, and a computer program. (RT)

Described is a computer algorithm for obtaining the coordinates of vertices, chord factors, and dihedral angles for plotting orthographic and axonometric projections, and for tabulating chord lengths and dihedral angles. (Author)

Summarizes a simple design algorithm which identifies nested loops of equations which must be solved by trial-and-error methods. The algorithm is designed to minimize such loops, provides guidance to the selection of variables, and delineates the order in which systems of equations are to be solved. Examples are included. (TW)