Ada is a programing language developed for the Department of Defense, with a registered trademark. It was named for Ada Augusta, coworker of Charles Babbage and the world's first programer. The Department of Defense hopes to prevent variations and to establish Ada as a consistent, standardized language. (MNS)

Courses for a computer technology program are listed. Hardware purchases necessary to use a mainframe computer in a single-user environment in a computer organization course is described, and sample runs from three programs are included. (MNS)

Advocates discussion of self-motivation and its importance with computing majors, suggests wide reading in computing as a way to encourage majors to promote their own self-motivation and interest, and offers specific reading suggestions. (10 references) (MKR)

Definitions of computer science and computer literacy are discussed, with their implications for college instruction and job skills. Mathematics as a necessary condition for success in both is noted. (MNS)

An exercise simulating the tossing of N dice is described. Calculation of expected gain and extension to a two-person game are each discussed. (MNS)

A program written in PASCAL designed to find the number of binary trees possible for a given number of nodes is presented. The problem was found to be highly motivating and exciting for the group of introductory computer science students with whom it was used. (MP)

Shows how, with little or no electrical background, students can apply Boolean algebra concepts to design and build integrated electrical circuits in the classroom that will reinforce important ideas in mathematics. (PK)

Presents noncalculus approximation techniques for two normal distribution problems. These methods may be useful projects for lower-level undergraduate statistics and computer science students. (PK)

Teaching computer literacy to preservice teachers is advocated. How such a component was added to a mathematics course for preservice elementary teachers at Loyola Marymount University in Los Angeles is described. (MNS)

Shows by means of a mathematical example how algorithmic thinking and mathematical thinking complement each other. An algorithmic approach can lead to questions that deepen the understanding of mathematics material. (DDR)

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)

Considers the problem of how to go from three coordinates to two. States that it is not a problem that mathematics students ordinarily encounter. Presents four methods of graphing three-dimensional figures on a two-dimensional computer screen. (PK)

"Gedankensimulation" is a term adapted from Einstein's "thought experiments" to indicate mentally created simulations that can help conceptualize ideas. Presents seven examples of simulations that can be utilized to solve problems or illustrate concepts in probability and statistics. Problem contexts include games of chance,…