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)

There are many uses for the shortest path algorithm presented which are limited only by our ability to recognize when a problem may be converted into the shortest path in a graph representation. (Author/TG)

Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)

Four methods of filling a square using programing with Logo are presented, with comments on children's solutions. Analysis of the mathematical or programing concepts underlying a few simple algorithms is the focus. (MNS)

A program for drawing a line segment is developed. (MNS)

Reports on the findings of the Algorithms working group at the Ware, England, conference. Examines methods of introducing the algorithmic approach to mathematics via computer programing and using problems arising from content areas. Considers programing language and presents support for programming in mathematics curricula. (JM)

Details are given of a simple computer program written in BASIC which calculates the sine of an angle through an application of DeMoivre's Theorem. The program is included in the material, and the program's success is discussed in terms of why the approximation works. (MP)

Five problems on the generation and study of prime and related numbers are discussed. Solutions to the problems posed will be in next month's presentation. (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)

Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

This review of the literature and annotated bibliography summarizes the available research relating to teaching programming to high school students. It is noted that, while the process of programming a computer could be broken down into five steps--problem definition, algorithm design, code writing, debugging, and documentation--current research…

Proposes that the first computer language course for students of management should teach the reading of the language rather than the writing of programs in that language. "Reading" means the study of the programing language literature, including a variety of algorithms, to understand the language, inputs, and program use. (MF)

Describes Newton's method to locate roots of an equation using the Newton-Raphson iteration formula. Develops an adaptive method overcoming limitations of the iteration method. Provides the algorithm and computer program of the adaptive Newton-Raphson method. (YP)

One college writing teacher engaged his class in the revision of a computer program to check grammar, focusing on improvement of the algorithms for identifying inappropriate uses of the passive voice. Process and problems of constructing new algorithms, effects on student writing, and other algorithm applications are discussed. (MSE)

The first aim in school might be to help children become more aware of the algorithmic processes they use; then, ensure that they can devise algorithms and define them. Many examples of how these aims can be met are given, including the use of calculators and computers. (MNS)