Generally, when recursion is introduced to students the concept is illustrated with a toy (Towers of Hanoi) and some abstract mathematical functions (factorial, power, Fibonacci). These illustrate recursion in the same sense that counting to 10 can be used to illustrate a for loop. These are all good illustrations, but do not represent serious…

Outlines an articulation program between college and industry. Describes three seminar courses using the college's computer system. Considers the benefits of the program. (Author/YP)

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)

Describes a format for assignments that trains students to write short, persuasive essays. Essay topics address how software available in the computing lab can use a computing technique. Points are scored by making multiple concise arguments that answer different aspects of the essay question. (PVD)

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)

Details the topics of a new course that introduces computing and communication technology to students not majoring in computer science. Discusses the process of developing a Java applet (a program that can be invoked through a World Wide Web browser) that illustrates the protocol used by ethernet local area networks to determine which computer can…

Described are experiences for incorporating writing assignments in mathematics and computer science courses. Reports survey results from students who participated in the courses. (YP)

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)