A brief introduction to the broad field of curve-fitting is provided to help explain the reasoning behind least-squares data fitting, and also to provide useful equations for two functional forms of interest in chemistry. Appendices give program examples written in Fortran and detail the method of Guggenheim. (MP)

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)