Teaching computer science with APL: An introduction to search procedures

  • Authors:
  • Stewart A. Denenberg;Howard A. Peelle

  • Affiliations:
  • Assistant Professor, Department of Computer Science, State University of New York, Plattsburgh, New York;Associate Professor, Instructional Applications of Computers, School of Education, University of Massachusetts, Amherst, Massachusetts

  • Venue:
  • APL '79 Proceedings of the international conference on APL: part 1
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

We suggest that APL be used to teach selected topics in computer science. As a case in point, we take the topic: “An Introduction to Search Procedures for Problem-Solving” This is the first topic in a series of experimental curriculum units currently being developed at the University of Massachusetts. In this paper, recursive APL functions are used to demonstrate fundamental search procedures, namely: Breadth-First Search Depth-First Search Random Search Heuristic Search For illustration, a simplified Water Jug Problem is used with a state-space representation. The reader is invited to consider programming enhancements as well as extensions to other problems. In closing, we cite some other topics potentially suitable for teaching with APL and mention implications for computer-science education.