Login | Register

Data structure animation tutorial


Data structure animation tutorial

Yiling, Sun (2001) Data structure animation tutorial. [Graduate Projects (Non-thesis)] (Unpublished)

[thumbnail of MQ68524.pdf]
Text (application/pdf)


This study is an animation tutorial for the people who wants to learn the Data Structure. The emphasis is placed on vivid animations to help the people to understand algorithms for data structure easily. Some of the implementations to be addressed are: stack (Array-Based Stack, Linked Stack), queue (Array-Based Queue), List (Circular Linked List, Double Linked List, Linear Linked List), sort (Quick Sort, Merge Sort, Bubble Sort, Shell Sort, Insertion Sort, Heap Sort, Radix Sort, Selection Sort), heap (Priority Queue, Heap Build, Heap Sort), recursive (Tower of Hanio), hashing (Open Hashing, Close Hashing) binary search (Loop, Recursive), tree (2-3 Tree, Huffman Tree, Binary Search Tree, Balance Tree). Conclusions are formulated in terms of further work to be accomplished in order to better help understanding the completed algorithm.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Graduate Projects (Non-thesis)
Authors:Yiling, Sun
Pagination:iii, 63 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science
Department (as was):Department of Computer Science
Thesis Supervisor(s):Tao, Lixin
Identification Number:QA 76 M26+ 2001 no.10
ID Code:1407
Deposited By: Concordia University Library
Deposited On:27 Aug 2009 17:19
Last Modified:20 Oct 2022 20:44
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top