You can help the community by contributing reviews and ratings to the catalog.
Here is a detailed description for the catalog entry structure.
CS Animated - Big O Notation
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Flash |
||||
License |
Non-Commercial |
||||
Language |
English |
||||
Author |
Bill Jacobs |
||||
Institution |
None |
||||
Project |
Jacobs' AV Lectures |
||||
Works |
Yes |
||||
Description |
A simple, basic introduction to big O notation. 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 |
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. |
CS Animated - Accounting Method
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Flash |
||||
License |
Non-Commercial |
||||
Language |
English |
||||
Author |
Bill Jacobs |
||||
Institution |
None |
||||
Project |
Jacobs' AV Lectures |
||||
Works |
Yes |
||||
Description |
An introduction to amortized analysis. 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. Another version of this same content is at http://www.csanimated.com/animation.php?t=Aggregate_analysis. |
||||
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 |
|
||||
Edit |
You may edit this entry if you have an account. |
CS Animated - Master Theorem
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Flash |
||||
License |
Non-Commercial |
||||
Language |
English |
||||
Author |
Bill Jacobs |
||||
Institution |
None |
||||
Project |
Jacobs' AV Lectures |
||||
Works |
Yes |
||||
Description |
Introduction to the master theorem for divide-and-conquer recurrence relations. 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 |
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. |
Swan - Finding Minimum and Maximum Values
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Windows Application |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Jun Yang, Cliff Shaffer |
||||
Institution |
Virginia Tech |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Demonstrates the algorithm for simultaneously finding the minimum and maximum values in an array. |
||||
Evaluation |
The key issue with this algorithm is the lower bounds proof for the problem, not the workings of the algorithm. This AV does not explain the lower bounds issue, it only presents the algorithm. Might be useful as an incidental lecture aid, but not useful for students learning on their own. |
||||
Random Data; Step Control |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-11-08 |
||||
Last Visited |
2008-06-27 |
||||
Last Updated |
1996 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
ALVIE - Amortized Analysis
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
By Request |
||||
Language |
English |
||||
Author |
Pilu Crescenzi |
||||
Institution |
University of Florence |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Shows a simple counting example to illustrate two techniques for Amortized Analysis. |
||||
Evaluation |
Simple-to-use user interface for walking through the example. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors. |
||||
Step Control; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
http://sites.google.com/site/alviehomepage/alvie3/downoads/binaryCounter.swf |
||||
References |
|
||||
Download and unzip the ALVIE system from the website. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which selecting the Closest Pair of Points. Once selected, click OK and step through the AV with the arrow icons. |
|||||
First Visited |
2010-01-28 |
||||
Last Visited |
2010-01-28 |
||||
Last Updated |
2009-12-20 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |