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)

Instructors teaching beginning programming classes are often interested in exercises that involve processing photographs (i.e., files stored as .jpeg). They may wish to offer activities such as color inversion, the color manipulation effects archived with pixel thresholding, or steganography, all of which Stevenson et al. [4] assert are sought by…

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)

Provides background material on logic programing and presents PROLOG as a high-level artificial intelligence programing language that borrows its basic constructs from logic. Suggests the language is one which will help the educator to achieve various goals, particularly the promotion of problem solving ability. (MVL)

"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,…