The purpose of this paper is to show, by computer examples, that very different results can be obtained by rearranging selected conditionally convergent series. Computer programs allow the students to select the real number to which they wish the rearrangement to converge. Two computer programs are appended. (KR)

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

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)

The programing language PROLOG is compared to LOGO in terms of its ability to handle mathematical ideas. This is demonstrated by using PROLOG in solving a geometric theorem and two lemmas. The listings of the computer programs used to solve the problems are included. (KR)

This article presents a vector-analysis approach to the classical three-point problem in hydrogeology. Problem sets involving strike and dip, and ground water flow including computer programs (in BASIC) for their solution are given. (CW)

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)

States the objectives and implementation procedures for this teacher-directed or individualized learning discovery unit. Describes the value of the program and additional activities that can be included. Shows a copy of the program. (RT)