A CAI for linked lists algorithms

Includes bibliographical references (page 65)The goal of the Linked List Algorithm Prototype (LLAP) project is to develop a Computer-Aided-Instruction package that simulates three algorithms: RETRIEVAL, INSERTION and DELETION of linked lists. The package is implemented to run on a Teleray terminal and is written in OMSI PASCAL for a PDP 11/70. It contains three lessons with four phases: introduction, tutor, simulation, and conclusion. The algorithm???s purpose and required data structures are discussed in the introduction phase. The tutor phase describes a pseudo-code algorithm and the necessacy variables and data structures. The simulation phase steps through the algorithm and updates a graphic display of the list structures and the attendant variables. A conclusion screen is used to summarize each algorithm's performance relative to other simulations in the package