The first section of this course on programming introduces LISP as a programming language designed to do symbol manipulation, with consequent prevalence in auto-instructional (AI) work. A programming language specifies in its description a number of primitive operations which the computer knows how to perform. An algorithm is the set of instructions which constitutes a description of the method by which the task can be performed. This algorithm must be written in the programming language which the computer can deal with. The constructs (elements of LISP) that work in algorithms are described and an example task provided. LISP is a functional language, in that its instructions consist of directives to apply some function to some argument. Part 1 of the course concludes with a description of some of LISP's functions, and Part 2 deals with its symbol manipulation functions, specifically in manipulating LISP constructs known as lists. Part 3 gives instruction in writing inherently recursive functions non-recursively. Practice exercises follow each section of the course. (CLK)