Exploring the role of visualization and engagement in computer science education
Working group reports from ITiCSE on Innovation and technology in computer science education
Effective features of algorithm visualizations
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Algorithm visualization: a report on the state of the field
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Supporting the rapid development of pedagogically effective algorithm visualizations
Journal of Computing Sciences in Colleges - Papers of the Fourteenth Annual CCSC Midwestern Conference and Papers of the Sixteenth Annual CCSC Rocky Mountain Conference
| Hi-index | 0.00 |
This paper reports on a collection of algorithm animations of dynamic programming and branch-and-bound problems developed in JHavé. After a discussion on how these algorithm animations meet the criteria for a pedagogically effective algorithm visualization (PEAV), it presents the collection of algorithms available and for each type an example is used to illustrate the materials available and their potential. The paper also describes their use in two courses and together with observations about their effectiveness.