Trakla - Heap Tutorial

Link(s)
http://svg.cs.hut.fi/heaptutorial/
Topic(s)
Heap

Screenshots
Tralkla Heap Tutorial Screenshot 1
Tralkla Heap Tutorial Screenshot 2


Recommendation
  
Lecture Aide Recommended
Self-study Supplement Recommended
Standalone Recommended
Debugging Aide Recommended
Works?
Yes
Delivery Method(s)
Java Applet
Project
TRAKLA2
Project Relationship
Part of project
Language(s)
English
Author(s)
Mikko Laakso, Ari Korhonen, Ville Karavirta
Institution(s)
Aalto University
Activity Level(s)
Canned data, Predictions, Slideshow
Source Code License
Licensed under GPL
First Published
N/A
Last Modified
N/A
Awards
AlgoViz.org Award Winner - 2010

Description

A complete tutorial for Binary Heaps. The viewer is first taken through short tutorial pages on several topics related to the binary heap, such as the concept of a priority queue, the array representation for binary heaps, MinHeap vs. MaxHeap, etc. The viewer is then asked to work through some simple interactive exercises dealing with Insert, DeleteMax, BuildHeap and finally the HeapSort algorithm. 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. "Model solutions" provide a slide show of the correct steps to solve the exercise.

Evaluation

Fairly complete tutorial on basic heap representation and implementation. The interactive exercises are effective, yet easy to use. The advantage of interactive exercises is that the viewer gets to test his or her knowledge about the various algorithms to verify understanding.

Usage Notes

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".

Field Report(s)
Field Report: 1
Field Report: 2
References
http://algoviz.org/node/171
Rating
5
Average: 5 (1 vote)
Your rating: None
AV of the Day
No
Score
84