A few examples are discussed of situations where some solution to writing a computer program for an algorithmic problem is immediately evident, but the best solution is some distance away. (MP)

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)

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)

Growth functions involved in mathematical models for biological development are discussed using the algebra of polynomials and matrices. (SD)

The evolution of Archimedes' method is traced from its geometrical beginning as a means to approximate pi to its modern version as an analytical technique for evaluating inverse circular and hyperbolic functions. It is felt the web of old and new algorithms provides considerable instructional material, and ideas are offered. (MP)

The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)

A college course designed to teach students about the mathematics of symmetry using pieces of wallpaper and cloth designs is presented. Mathematical structures and the symmetry of graphic designs provide the starting point for instruction. (MP)

The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)

Three types of arithmetic algorithms are discussed and compared. These are algorithms designed to get the right answer, computer algorithms, and algorithms designed to get the right answer and understand why. (MP)

Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)