Design Considerations for Instructional Computing Programs
Walter Wager
Abstract
Walter Wager
Abstract
This article reviews four different CAI algorithms in light of an instructional theory based on the work of Robert Gagné. The author concludes that different types of CAI supply different events of instruction to the learner. This implies that different types of CAI are more or less complete as instructional strategies, and that different types of CAI are more or less appropriate depending on the nature of the capability to be learned. Designers should be aware of how the CAI programs will be used and work toward providing the instructional events necessary to be effective.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article reviews four different CAI algorithms in light of an instructional theory based on the work of Robert Gagné. The author concludes that different types of CAI supply different events of instruction to the learner. This implies that different types of CAI are more or less complete as instructional strategies, and that different types of CAI are more or less appropriate depending on the nature of the capability to be learned. Designers should be aware of how the CAI programs will be used and work toward providing the instructional events necessary to be effective.
Key concepts: Computer science, Instructional design, Computer-Assisted Instruction, Work (physics), Mathematics education, Individualized instruction, Multimedia, Teaching method