The problem of structuring sequences of instructional stimuli such that learning is optimized is modelled as a sequential decision problem with an imbedded mathematical model of learning providing a criterion function. Three types of optimization methods for such a representation are investigated for the specific case of paired-associate learning…

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)

In the past, algorithm animation has yielded mixed results as a teaching tool in computer science. This article presents a study in which undergraduates at George Washington University (DC) viewed algorithm animations and then programmed the same algorithms. Results suggest that combing the two is an effective way to use animation and to produce…