Heaps - Algoviz Wiki

Works

Yes

Description

A collection of exercises related to building and deleting from heaps. User works through the exercises, swapping elements within the heap to demonstrate proficiency.

Evaluation

This works well as an exercise, since the mechanics are at the right level of granularity to gain understanding without becoming too repetitive. Several aspects of building and deleting from heaps are included.

Canned Data; Predictions

Lecture Aid; Self Study; Lab Exercise

Screenshots

Videos

References

The link above takes you to a listing of all the Trakla exercises. Under "Priority queues" there are several links to the heap exercises. Clicking any of these links brings up a java applet. Clicking on the "instructions" tab gives brief instructions on what to do. For example, the heap building exercise requires that you swap values in the tree or array, and in the right order, to build the heap. You can see what the correct series of steps would be by clicking on "Model Answer". You can have the system tell you how well you did by clicking on "Grade".

First Visited

2008-07-29

Last Visited

2009-08-31

Last Updated

2006-01-25

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://svg.cs.hut.fi/heaptutorial/

Edit

You may edit this entry if you have an account.

Trakla - Heap Tutorial

Recommendation

Unrated

Link

Delivery Method

Java Applet

License

GPL

Language

English

Author

Mikko Laakso; Ari Korhonen; Ville Karavirta

Institution

Helsinki University of Technology

Project

Trakla2

Works

Yes

Description

A complete tutorial for Binary Heaps. The viewer should first read the short tutorial on several topics related to binary heap such as ADT priority queue, array representation of binary heap, MinHeap vs. MaxHeap, etc. and then solve the visual algorithm simulation exercises dealing with Insert, DeleteMax, BuildHeap and finally HeapSort algorithms. The exercises are implemented as Java applets and they provide immediate feedback on the correctness of the simulation. The exercise can be solved with many inputs until the algorithm is mastered. See also the model solutions, which include algorithm animations.

Evaluation

Canned Data; Predictions

Self Study; Lab Exercise

Screenshots

Videos

References

Laakso, et al 2009

The link above takes you to a table of contents for the topics covered by the tutorial. As you work through the topics, you will come to various exercises implemented as Java applets. For each exercise, clicking on the "instructions" tab gives brief instructions on what to do. For example, the heap building exercise requires that you swap values in the tree or array, and in the right order, to build the heap. You can see what the correct series of steps would be by clicking on "Model Answer". You can have the system tell you how well you did by clicking on "Grade".

First Visited

2009-08-31

Last Visited

2009-08-31

Last Updated

2009-08-13

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://people.ksp.sk/~kuko/bak/

Edit

You may edit this entry if you have an account.

Kovac's Heap Visualization

Recommendation

Unrated

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Kubo Kovac

Institution

Comenius University, Slovakia

Project

Kovac's Tree Project

Works

Yes

Description

This AV shows various search trees such as AVL, BST, B tree, red-black tree, AA tree, skiplist, heap, treap, scapegoat tree and splay tree. It demonstrates insertion, deletion and search. Users can start with randomly generated input dataset or user's own data. For the data structuers where this is relevent, it provides balance factors such as ‘+’, ‘-‘ and ‘.’ by the nodes.

Evaluation

Strengths: The best feature of this tool is to provide many search trees. This may allow learners to identify how the search trees work by comparison with each other. Randomly generated dataset lets users quickly see the structure of the tree. Users can also construct their own data set. Weaknesses: Like many tree AVs, it just shows the result of the insert or delete operation, without explaining how it works. What is neeed is good textual explanation about each search structure and documentation explaining basic key concepts such as balance factors, re-balancing, etc. The text size of balance factors on the nodes is too small to be recognized (you need to use the "big" version of the applet to see them at all).

Exploring the Concept; Comparison; Lecture Aid

Screenshots

Videos

References

First Visited

2007

Last Visited

2008-06-12

Last Updated

2007

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.csanimated.com/animation.php?t=Heap_%28data_structure%29

Edit

You may edit this entry if you have an account.

CS Animated - Heaps

Recommendation

Has Potential

Link

Delivery Method

Flash

License

Non-Commercial

Language

English

Author

Bill Jacobs

Institution

None

Project

Jacobs' AV Lectures

PartOfCollection

Works

Yes

Description

An introduction to heaps. A multimedia lecture, with audio used to explain the data structure and a series of slides for the visual component. Each slide has its own video component, so it is easy to move through the lecture. Each slide has flash animation as appropriate. See also http://www.csanimated.com/animation.php?t=Priority_queue for a brief introduction to priority queues.

Evaluation

Not interactive, but in that sense it is certainly no worse than a standard animation. The presentations are clear.

Animation Only; Canned Data

Self Study

Screenshots

Videos

References

First Visited

2008-06-23

Last Visited

2008-06-23

Last Updated

2008-06-01

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cs.usfca.edu/galles/visualization/download.html

Edit

You may edit this entry if you have an account.

Data Structure Visualization - Heap

Recommendation

Has Potential

Link

Delivery Method

Java Application

License

Unlicensed Sourcecode

Language

English

Author

David Galles

Institution

University of San Francisco

Project

Data Structure Visualization

Works

Yes

Description

Users can enter data values into a min-heap, and remove the smallest value. Alternatively, user can have an array of 32 values generated, and then watch an animation of the build process.

Evaluation

No code or explanation of what is happening. When a value is inserted, user then watches an animation of the insertion process. This can make it hard to follow what is happening.

Animation Only; User Data; Canned Data

Lecture Aid; Debugging

Screenshots

Videos

References

First Visited

2006-09-01

Last Visited

2008-07-01

Last Updated

2006-04-05

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://users.csc.tntech.edu/~algviz/priority_queue/visualization.php

Edit

You may edit this entry if you have an account.

Priority Queue - Visualization

Recommendation

Unrated

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Institution

Tennessee Tech

Project

Tennessee Tech

Works

Yes

Description

Priority Queue with a step by step visualization of each of the operations.

Evaluation

Strengths: Explains step by step each operation alongside pseudocode. Weaknesses: The pre-made Priority Queue makes the visualization confusing at first.

Exploring the Concept

Screenshots

Videos

References

First Visited

2006-04-04

Last Visited

2008-06-10

Last Updated

2005

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://window.terratron.com/~sosman/computers/java/heap/

Edit

You may edit this entry if you have an account.

SOsman Heap

Recommendation

Unrated

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Steven Osman

Institution

Terratron Technologies, Inc.

Project

StandAlone

StandAlone

Works

Description

Evaluation

Screenshots

Videos

References

First Visited

2008-06-10

Last Visited

2008-06-10

Last Updated

1999

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/Heap/heap.html

Edit

You may edit this entry if you have an account.

Ghosh - Heap Data Structure

Recommendation

Has Potential

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

R. K. Ghosh

Institution

Indian Institute of Technology, Kanpur

Project

Ghosh's Collection

PartOfCollection

Works

Yes

Description

A very simple visualization that explains the basic concept of the heap data structure. It has a Next, Insert, Delete etc buttons like any other visualization. It has message box that keeps showing you what to do in every step. They also give a detailed instructions of the color terminology that they use in their visualization to run the heap data structure. The animations are simple. The user can press finish to complete inserting elements into the heap.

Evaluation

The visualization is intuitive and simple. The message box is helpful for a fresh user to quickly get used to the visualization. The Finish and the Reset buttons were confusing initially. The explanations were very brief and did not explain operations in detail. The AV does not allow you to enter more than 2 digits and once you enter 2 digits you cannot erase the number, which is slightly irritating at time, but over all its a very simple AV to describe heap data structure. The animation portion needs speed control since it often feels too slow. It can be tedious to build up a heap.

User Data; Step Control

Lecture Aid

Screenshots

Videos

References

First Visited

2006-11-06

Last Visited

2008-07-15

Last Updated

2001-08-12

Topic

Community

Average rating:	3.0
Your rating:	You must be logged in to Rate.

http://nova.umuc.edu/~jarc/idsv

Edit

You may edit this entry if you have an account.

Interactive Data Structure Visualization - Priority Queue

Recommendation

Recommended

Link

Delivery Method

Java Applet

License

By Request

Language

English

Author

Duane J. Jarc

Institution

University of Maryland University College

Project

IDSV

Works

Yes

Description

User can build a priority queue. Shows step-by-step how the data values are moved around.

Evaluation

Good visualization. Easy-to-use controls, considering all that is here. User can select values to enter, or they can be picked randomly. User can either watch what happens, or can choose to "predict" where the new values go.

Lecture Aid; Self Study; Lab Exercise

Screenshots

Videos

References

First Visited

2008-06-10

Last Visited

2008-07-15

Last Updated

2005-12-03

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cs.auckland.ac.nz/software/AlgAnim/heaps.html#p_queue_anim

Edit

You may edit this entry if you have an account.

Auckland - Priority Queue

Recommendation

Has Potential

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Woi Ang; John Morris

Institution

University of Auckland

Project

Morris' Collection

PartOfCollection

Works

Yes

Description

Shows array and tree representations. Step-by-step explanations of what is happening, with bounce-along pseudocode.

Evaluation

Rather unclear what this does. There is more going on than building a priority queue (heap). Values are going in and out, sort of like replacement selection in an external sort. At the detail level, its reasonably clear what is happening in terms of a value going into the tree, etc. The total presentation is long and tedious, however.

Step Control; Animation; Canned Data

Lecture Aid; Self Study

Screenshots

Videos

References

First Visited

2006-11-06

Last Visited

2008-07-17

Last Updated

1998

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cosc.canterbury.ac.nz/mukundan/dsal/MinHeapAppl.html

Edit

You may edit this entry if you have an account.

Java Applets Centre - Priority Queue

Recommendation

Not Recommended

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

R. Mukundan

Institution

University of Canterbury

Project

Java Applets Centre

Works

Yes

Description

Presentation for a min-heap. User enters values (or asks for random values) that are put into the min-heap as the user enters them. User can also remove the minimum value.

Evaluation

Simple to use. When a value is inserted, it is then moved to its position in the heap. But this happens with no explanation, and while the values swap with their parents as they move up the heap, the action is not user controlled and happens rather quickly. So it is hard to tell what is going on.

Lecture Aid

Screenshots

Videos

References