You can help the community by contributing reviews and ratings to the catalog.
Here is a detailed description for the catalog entry structure.
Animal - Queue
Recommendation |
Recommended |
||||
Link |
http://www.animal.ahrgr.de/showAnimationDetails.php3?anim=45 |
||||
Delivery Method |
Animal Animation |
||||
License |
Non-Commercial |
||||
Language |
English; German |
||||
Author |
André Flöper |
||||
Institution |
TU Darmstadt, Darmstadt, Germany |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Presents a tutorial describing queues using a linked implementation. This is a "slideshow," as in a presentation for class. |
||||
Evaluation |
Clear presentation. Students should be able to understand it. A nice feature is including information about "common mistakes". |
||||
Animation; Step Control; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|||||
Videos |
|
||||
References |
|
||||
For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace. |
|||||
First Visited |
2007-07-21 |
||||
Last Visited |
2010-02-05 |
||||
Last Updated |
1999-05-12 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Java Applets Centre - The Queue
Recommendation |
Has Potential |
||||
Link |
http://www.cosc.canterbury.ac.nz/mukundan/dsal/appldsal.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
R. Mukundan |
||||
Institution |
University of Canterbury |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Two Queue AVs available: Simple abstract queue AV and a circular queue. |
||||
Evaluation |
Strengths - Simple, clear presentation of the basic queue operations. Weaknesses - While it does a good job of showing what the basic operations do, it does not show how they work. There is also the possibility that the user will be mislead since the delete operation shows all of the elements being "moved up" in the queue. |
||||
Random Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-03 |
||||
Last Visited |
2008-07-21 |
||||
Last Updated |
2006 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
CS Animated - Queue
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Flash |
||||
License |
Non-Commercial |
||||
Language |
English |
||||
Author |
Bill Jacobs |
||||
Institution |
None |
||||
Project |
Jacobs' AV Lectures |
||||
Works |
Yes |
||||
Description |
Simple introduction to the queue. 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. |
||||
Evaluation |
Only explains what a queue is, no details on implementation. 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 |
|
||||
Edit |
You may edit this entry if you have an account. |
Ghosh - Stack and Queue
Recommendation |
Not Recommended |
||||
Link |
http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/StacksQueues/stackqueue.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
R. K. Ghosh |
||||
Institution |
Indian Institute of Technology, Kanpur |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Basic stack and queue operations. |
||||
Evaluation |
Bright/ugly interface. Fairly straightforward operation. But the animation that occurs for each operation is not under user speed control, and is painfully slow. |
||||
User Data; Step Control |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-08-01 |
||||
Last Visited |
2008-07-15 |
||||
Last Updated |
2001-08-09 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
JAWAA - Queue
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Non-OSI Open Source |
||||
Language |
English |
||||
Author |
Susan Rodger |
||||
Institution |
Duke University |
||||
Project |
|||||
Works |
Yes |
||||
Description |
This visualization tool explains basic operation of the Queues. But animation is very weak and because of that whole purpose of using visualization is lost. |
||||
Evaluation |
This tool is good enough to complement a tutorial on Queues, but not usable in lecture |
||||
Animation Only; Canned Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-02 |
||||
Last Visited |
2008-07-23 |
||||
Last Updated |
2002 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Data Structures Navigator - Lists - DoubleLinked List - Queue
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Jens-Peter Dittrich; Jochen van den Bercken; Tobias Schäfer; Marcus Klein |
||||
Institution |
Phillips-University of Marburg |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Three basic functions are supported in this applet: enqueue that is insertion of the nodes, dequeue that is deletion of nodes and peek that is finding the node within the linked list. All the functions works properly and do their require task. Their is an history pane besides the animation window that shows the command executed which is a nice feature since it would help users in keeping track of the operations that have already been performed and also would be helpful in understanding the concepts behind linked list with queue as data structure. Some of the features that are present in this visualization tools are like selecting key type that is whether the data inserted in the nodes should be integer or character. It is possible to control speed of animation. Also their is zoom in feature in order to aide proper visualization. |
||||
Evaluation |
Visualization tool could be useful during lecture session, it can help users in understanding the concepts but some kind of tutorial along with this visualization would make it really useful. Applet has decent interface with button label being very obvious but some kind of description along with the applet would be nice. Documentation stating how to use this applet would be good to have. Some of the features that will be nice to have would be improve animation so that it can show pointer update that are being done when nodes get inserted or deleted since thats one of the fundamental concepts in link list. Also it would be nice to have some information related to pointer updates in history field, so when nodes get inserted or deleted the function displayed in history field also shows the pointer updates. |
||||
User Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-04-22 |
||||
Last Updated |
2000-07-31 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Data Structure Visualization - Queue-Array
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Simple presentation of a (circular) array-based queue. Somewhat abstract presentation since it doesn't relate to any code or implementation. |
||||
Evaluation |
Easy to use. Might be a little tedious entering what are essentially meaningless random numbers to be inserted. No code or indication of how the operations work, only what they do (with head and tail pointers). |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-01 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Data Structure Visualization - Queue-Linked List
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
A visualization of the enqueue and dequeue operations for a simple queue implemented using a singly linked list. |
||||
Evaluation |
The learner may choose the actions and the input. The movements are smoothly animated. There is a weakness in that the dequeue operation seems to indicate that the deleted link node just "goes away" which doesn't give the user any indication of the difference between properly handling the memory vs. having a memory leak. It might become tedious to manually enter what is essentially meaningless data values. |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-01 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Interactive Stack and Queue ADTs
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
Michael Goodrich |
||||
Institution |
Johns Hopkins University |
||||
Project |
Goodrich's Collection |
||||
Works |
Yes |
||||
Description |
Demo for queues using arrays and linked lists. This isn't exactly a visualization, but it might fill some of the same needs that visualizations fill. |
||||
Evaluation |
Strengths: simple test harness for playing with stack operations; both array-based and linked-list-based stacks. Weaknesses: not really a visualization |
||||
|
|||||
Exploring the Concept; Debugging |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-08-30 |
||||
Last Visited |
2006-08-30 |
||||
Last Updated |
1999-12-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Circular Queue
Recommendation |
Not Recommended |
||||
Link |
http://maven.smith.edu/~streinu/Teaching/Courses/112/Applets/Queue/myApplet.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Ileana Streinu |
||||
Institution |
Smith College |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Simple interactive circular queue demonstration. Users can add values (it counts up by 5s) and remove values. |
||||
Evaluation |
Clear presentation so far as it goes. Shows the effects of adding and removing from an abstract circular queue. There are no implementation details shown, such as how to implement a circular queue in an array. The code is supposed to be available, but that page has restricted permission. |
||||
Canned Data; Step Control |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-02 |
||||
Last Visited |
2009-04-30 |
||||
Last Updated |
2005 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
UGa Queue Made Easy
Recommendation |
Has Potential |
||||
Link |
http://lsdis.cs.uga.edu/~aleman/mams/csci6900/hci/partb/queue/MyQueue.php |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Boanerges Aleman-Meza |
||||
Institution |
University of Georgia |
||||
Project |
University of Georgia Collection |
||||
Works |
Yes |
||||
Description |
Users enter values to put on thequeue, and/or request a value to be removed from the queue. This shows values being put on/taken off of an abstract queue, does not show anything about how queues are implemented. |
||||
Evaluation |
Strengths: Users control what goes on/comes off. Clean, clear interface. Weaknesses: Buggy, in that it will stop working after some number of operations (typically after inserting/deleting five or so times). It is marked "Partially Working Prototype." |
||||
User Data |
|||||
Teaching the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2009-04-28 |
||||
Last Updated |
2006-05-06 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Queue Applet
Recommendation |
Recommended |
||||
Link |
http://courses.cs.vt.edu/csonline/DataStructures/Lessons/QueuesImplementationView/applet.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Shad Gilley |
||||
Institution |
Virginia Tech |
||||
Project |
|||||
Works |
Yes |
||||
Description |
An applet that shows a queue in three different views: abstract, logical and physical. The abstract view visualizes how items are inserted into the tail end of the queue and removed from the head of the queue. The logical view represents the queue as a circular structure and shows how the head and tail pointers traverse from the end of the array to the start of the array. The physical view shows how the queue items are stored in the computer memory. The abstract view is shown by default, while the other two can be shown or hidden by the user. There is also a set of instructions on how to use the applet. |
||||
Evaluation |
The applet shows well how queues work and how they are implemented. The use of three different views support learning by showing the queue structure and queue operations in various abstraction levels. The user interface is simple and easy to use but maybe the use of other colours than just grey and black could make it more pleasant to watch. For example queue items with different colours might help in following of the animation. Also, it would be useful to have a possibility to insert some random default values into the queue. |
||||
User Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2008-07-02 |
||||
Last Updated |
2001-01-17 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Java Queue Applet Demo
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
Thomas Wang |
||||
Institution |
None |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Very simple queue demonstration. Users can enqueue elements (text strings) and dequeue them. |
||||
Evaluation |
Strengths: Simple, clear for what it does. Weaknesses: Fairly limited. No connection to a queue implementation (it is an abstract queue) |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-07-18 |
||||
Last Visited |
2008-06-16 |
||||
Last Updated |
1997-01-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Lafore's Priority Queue
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Robert LaFore |
||||
Institution |
None |
||||
Project |
LaFore's Book |
||||
Works |
Yes |
||||
Description |
Very simple priority queue demonstration. This is not a heap-based priority queue, but merely a sorted queue that inserts new elements by swapping elements from the front. |
||||
Evaluation |
Strengths: Colored, and pseudocode is provided as the visualization is stepped through. Weaknesses: No "step" button, the operation button must be clicked multiple times to step through. This is a problem because if you don't stop at the end of an insert (which is hard to recognize), a new copy of the same record will be inserted. |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-08-30 |
||||
Last Visited |
2008-06-16 |
||||
Last Updated |
2002 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Lafore's Queue
Recommendation |
Not Recommended |
||||
Link |
http://mainline.brynmawr.edu/Courses/cs206/spring2004/WorkshopApplets/Chap04/Queue/Queue.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Robert LaFore |
||||
Institution |
None |
||||
Project |
LaFore's Book |
||||
Works |
Yes |
||||
Description |
Very simple queue demonstration. |
||||
Evaluation |
Strengths: Colored, and pseudocode is provided as the visualization is stepped through. Weaknesses: No "step" button, the operation button must be clicked multiple times to step through. |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2008-06-16 |
||||
Last Updated |
2002 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
The "Step & Queue" Applet
Recommendation |
Has Potential |
||||
Link |
http://www2.hawaii.edu/~btimmerm/2003n4Fall/pa04/StackQueue.htm |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Ben Timmerman |
||||
Institution |
University of Hawaii |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Shows a stack and a queue side by side |
||||
Evaluation |
Strengths: Good comparison between a stack and a queue. Weaknesses: The elements of the queue aren't all properly displayed. |
||||
|
|||||
Teaching the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2008-06-16 |
||||
Last Updated |
2004-05-27 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
The Queue Applet
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Ben Timmerman |
||||
Institution |
University of Hawaii |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Shows a simple queue. Users can insert and delete values. |
||||
Evaluation |
Strengths: Simple representation of a queue. Weaknesses: Only two operations, In and Out, are provided. On some browsers, the left side (first value) is cut off. |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2009-04-28 |
||||
Last Updated |
2000 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Simple Queue
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
Dan Cieslak |
||||
Institution |
Cardiff University |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Simple queue of letters. |
||||
Evaluation |
You can insert and delete letters from the queue. No explanations for what is happening. Basic text graphics. |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2009-04-29 |
||||
Last Updated |
1996 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Queue Applet
Recommendation |
Unrated |
||||
Link |
http://acc6.its.brooklyn.cuny.edu/~cis22/animations/tsang/html/QUEUE/queue640.html |
||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
|
||||
Institution |
Brooklyn College of the City University of New York |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Graphical representation of a circular queue. |
||||
Evaluation |
Strengths: Contains pseudocde, and box detailing the values of all variables in the queue. Weaknesses: Sometimes difficult to read depending on the color scheme. |
||||
|
|||||
Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2006-04-04 |
||||
Last Updated |
|
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
The Java Queue Tutorial
Recommendation |
Unrated |
||||
Link |
http://www.cs.usask.ca/resources/tutorials/csconcepts/1998_2/queues/java/index.html |
||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
|
||||
Institution |
University of Saskatchewan |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Animated representation of a circular queue. |
||||
Evaluation |
Strengths: Allows user to step through each operation, with pseudocode highlighted for each step. Weaknesses: No physical representation shown. |
||||
|
|||||
Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-04 |
||||
Last Visited |
2006-04-04 |
||||
Last Updated |
|
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |






