CAI for recursion

Includes bibliographical references (pages 85-86)A screen oriented prototype Computer-Aided Instruction (CAI)\ud package about recursion is presented. It includes four recursive\ud algorithms: Factorial, Binary Search, Tower of Hanoi, and Binomial\ud Coefficients. This report briefly reviews the effectiveness of CAI\ud and the developments of CAI in computer science. The design\ud requirements and the overview of the package are described. A\ud walk through of the lesson Binary Search exemplifies the major\ud sub-lessons within each lesson. The four sub-lessons are:\ud introduction, tutorial, simulation/drill, and conclusion. The\ud detailed description of the design structure gives an insight to the\ud package from both the user's and programmer's standpoint. Finally,\ud problems encountered and possible future enhancements are\ud enumerated