By Topic

A tool for data structure visualization and user-defined algorithm animation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tao Chen ; Dept. of Comput. Sci. & Eng., Bridgeport Univ., CT, USA ; Sobh, T.

Data Structures and Algorithms is a fundamental course in Computer Science. However, many students find it difficult because it requires abstract thinking. It would be very helpful if there was a visualization tool of data structures such as arrays, queues, stacks, trees and graphs for students to manipulate. The tool would allow students to see how an element is inserted into or deleted from different data structures, how a tree is traversed in different order (preorder, in-order, post order, level-order), etc. Moreover, this tool would provide a simple language, by which students can write their own algorithms so that the execution of the algorithm is animated. This project is intended to create an exploration environment, in which students can learn through experimentation. This tool can be used as an effective supplement to the traditional classroom education and textbook for Data Structures and Algorithms courses. In this paper, a software application that features the visualization of commonly used data structures and their associated insertion and deletion operations is introduced. In addition, this software can be used to animate user-defined algorithms

Published in:

Frontiers in Education Conference, 2001. 31st Annual  (Volume:1 )

Date of Conference: