Scores on tests of temperament, programming aptitude, and critical thinking, together with SCAT scores and a measure of mathematical background, were correlated with achievement on an introductory programming course. (MM)

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)

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

This study concerned conceptual difficulties of college students learning programming and ways the teacher can simplify the process. An analysis of general strategies used in solving problems involving loops is given, with four types of hierarchical strategy categorized. Students had difficulty transforming their algebraic descriptions into…

Discusses a short computer program used in teaching the random (RND) function in the BASIC programming language. Focuses on the mathematical concepts involved in the program related to elementary probability. (JN)

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)

In this paper, prepared for a European conference on mathematics education, the author examines three types of computer use in undergraduate and high school classrooms: Using the computer as an instructional tool for student development of algorithms, teaching about the computer itself, and use of computer-assisted instruction. (SD)

This article considers the sum of a finite geometric series as applied to numeric data storage in the memory of an electronic digital computer. The presentation is viewed as relevant to programing in several languages and removes some of the mystique associated with syntax constraints that any language imposes. (MP)

Describes a course (Introduction to Numerical Techniques of Physics) which can be adapted to such courses as applied mathematics, numerical analysis, mechanical or electrical engineering, chemistry, and biomathematics. Course goals (including emphasis on the distinction between computing, programming and coding) and instructional strategies are…

This instructional unit of five lessons and four appendices is designed to acquaint both teacher and student with the elementary aspects of computer programming. The first two sections contain background information in computer processes and in BASIC language for a time-sharing system for those teachers who have limited backgrounds and experiences…

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)

It is noted that there are some integrals which cannot be evaluated by determining an antiderivative, and these integrals must be subjected to other techniques. Numerical integration is one such method; it provides a sum that is an approximate value for some integral types. This module's purpose is to introduce methods of numerical integration and…

This teaching guide is for the instructor of an introductory course in computer programming using FORTRAN language. Five FORTRAN programs are incorporated in this guide, which has been used as a FORTRAN IV SELF TEACHER. The base eight, base four, and base two concepts are integrated with FORTRAN computer programs, geoblock activities, and related…

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)