Stacks and queues : a CAI prototype

Includes bibliographical references (pages 81-82)This Computer-Aided Instruction package is a prototype\ud system. The purpose was to develop an interactive Computer-Aided\ud Instruction Lesson for static stack and queue data\ud structures and algorithms. It is primarily a graphic\ud demonstration and simulation of the two data structures.\ud Each lesson begins with an introduction screen followed by a\ud menu for algorithm selection. An algorithm for the addition\ud or deletion of a character from a stack or queue can be\ud chosen. For each lesson, the algorithm is explained in a\ud statement-by-statement walk-through. The algorithm\ud explanation is followed by a simulated demonstration. \ud Following the demonstration is an interactive tutorial on\ud how each statement in the algorithm affects the data\ud structure. Finally, a simulation-drill session is\ud presented. In the simulation drill session students must\ud correctly answer multiple choice questions as they are\ud walked-through the algorithm. The questions test the\ud student's comprehension about the current state of the\ud algorithm's execution. Incorrect responses are followed by\ud a repeat of the question.\ud The package was designed for student and teachers with\ud minimal programming background. It was designed as an aid\ud to students in a beginning data structure class. It is\ud coded in UCSD Pascal and is implemented on an Apple II\ud .microcomputer. Since it is menu-driven it is easy to use,\ud however a user manual is provided in the Appendix. I urge\ud all of you to run the system