Computer science and software engin

Computer science and software engineering courses generally include a core course on discrete data structures and algorithms to manipulate them. These courses, which are usually found in the second year with optional advanced courses in third and later years, aim to show students efficient ways to solve common problems. The discrete nature of the structures makes the visualization of the algorithms operating on them relatively easy to design: algorithm steps generally add or delete objects or
Copyright c
2003, Australian Computer Society, Inc. This paper appeared at the Australasian Computing Education Conference 2005, Newcastle, Australia. Conferences in Research and Practice in Information Technology, Vol. 42. Alison Young and Denise Tolhurst, Eds. Reproduction for academic, not-for profit purposes permitted provided this text is included.
rearrange an existing structure in some way. Many of the algorithms involve novel ideas that present conceptual difficulties to students and thus visualization represents a valuable additional pathway to understanding. Many algorithm animations have been written: they range from custom-coded animations of a single algorithm usually available on Web sites in support of individual courses(Kitchen 2004, Mitra 1999, Burgiel & Raymond 2004) - to complex systems to support generation of algorithm animations(Roessling & Freisleben 2001, Rodger 2002, Brown & Najork 1996). The present work describes a technique based on adding animation directives to the source code of the algorithm being animated. A toolkit of commonly used objects and methods to manipulate them is an essential part of this technique. This strategy has been used to generate a collection of animations to support a second year course in data structures and algorithms for engineers. The system described here includes direct support for a number of novel features which have been found useful to support the teaching goals: this paper’s purpose is to highlight a different approach to generating algorithm animations and several other features of the underlying animation toolkit and framework.

ผลลัพธ์ (อังกฤษ) 2:

Computer science and software engineering courses generally include a core course on discrete data structures and algorithms to manipulate them. These courses, which are usually found in the second year with optional advanced courses in third and later years, aim to show students ef fi cient ways to solve common problems. The discrete nature of the Structures Makes the visualization of the algorithms operating on them relatively Easy to Design: Add or Delete Objects or algorithm steps generally
Copyright C
2,003, Australian Computer Society, Inc. This Paper appeared at the Australasian Education Computing Conference two thousand and five, Newcastle. , Australia. Conferences in Research and Practice in Information Technology, Vol. 42. Alison Young and Denise Tolhurst, Eds. Reproduction for Academic, not-for Pro fi T purposes permitted provided this text is included.
Rearrange an existing structure in Some Way. Many of the algorithms involve novel ideas that present conceptual dif fi culties to students and thus visualization represents a valuable additional pathway to understanding. Many algorithm animations have been written: they range from custom-coded animations of a single algorithm usually available on Web sites in support of individual courses (Kitchen 2004, Mitra 1999, Burgiel & Raymond 2004) - to complex systems to support generation of algorithm animations. (Roessling & Freisleben 2001, Rodger 2002, Brown & Najork 1996). The present work describes a technique based on adding animation directives to the source code of the algorithm being animated. A toolkit of commonly used objects and methods to manipulate them is an essential part of this technique. This strategy has been used to generate a collection of animations to support a second year course in data structures and algorithms for engineers. The system described here includes direct support for a number of novel features which have been found useful to support the teaching goals: this paper's purpose is to highlight a different approach to generating algorithm animations and several other features of the underlying animation toolkit and framework.