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)

Presented are two computer programs which can be used to minimize the effort and time necessary to graph several individual functions. (TG)

A hungry worm is looking for something to eat according to very specific rules, and the path he takes is a graph. The problem is detailed in Applesoft BASIC using low resolution graphics for worms that turn 90 degrees and high resolution for worms that can turn 45 degrees. (MP)

This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)

Various ways in which computers can be used in the classroom depending on the subject, students' background, and individual teaching style are discussed. A way to evaluate professional software packages for use in the classroom is included. (KR)

Presented are exercises that demonstrate the application of standard concepts in the design of algorithms for plotting certain fractals. The exercises can be used in any course that explains the concepts of bounded or unbounded planar sets and may serve as an application in a course on complex analysis. (KR)

Presents a program for the Apple II computer that teachers can use for exam questions and homework assignments. Prints out all cubic polynomials whose roots, maximum and minimum points, and points of inflection are all integers. (MVL)