ViDaS (visualizing data structures)
Date of Publication
2003
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Computer Science
Subject Categories
Computer Sciences
College
College of Computer Studies
Department/Unit
Computer Science
Thesis Adviser
Tessie Limoanco
Defense Panel Chair
Tessie Limoanco
Defense Panel Member
Nathalie Lim
Nelson Marcos
Abstract/Summary
Visualizing Data Structures (ViDaS) is a source code simulator for trees that accepts syntactically correct source code written in ANSI C. It then animates the source code and keeps track of the variables. ViDaS uses the algorithm animation and data type visualization aspects of software visualization. It shows the tree functions like creation, insertion, deletion, traversal, searching and balancing of trees. It deals with binary trees including AVL trees, binary search trees, skewed trees and expression trees.
Keywords: Software Visualization, Algorithm Animation, Data Structures, Binary Trees, Tree Functions.
Abstract Format
html
Language
English
Format
Accession Number
TU13636
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
1 v. (various foliations) : ill. (some col.) ; 28 cm.
Keywords
Data structures (Computer science); Computer algorithms; Application software (Development); Application program interfaces (Computer software); Object-oriented programming (Computer science); System design
Recommended Citation
McDonnell, V., Barzaga, D. A., & Yu, J. (2003). ViDaS (visualizing data structures). Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/6883
