This tool tests whether the student understands Prim's algorithm, an important algorithm in graph theory that our CS students learn in their third-semester data structures course.
This
applet (not done by us) shows the algorithm at work. Try it out. Keep
clicking on the surface of the applet, and the next step is revealed.
Pretty, but ineffective as a learning tool.
In our approach, it is the student's job to actively
produce the animation, not to passively watch it.

When the tool is launched, a new random graph is produced. The student never sees the same problem twice.
The student's job is to pick the correct tool from the tool box in the upper right corner. Usually, tools will require the student to supply additional information, such as clicking on a vertex or supplying a value.
The toolbox design allows us to quickly modify our framework for other algorithm types. The graph will look different, the tools will be different, but the underlying framework for interacting with the student and evaluate student actions is reusable.
We don't expect you to know Prim's algorithm as well as our student do, so we made a slight modification to the framework. The framework tells you the next step. (This also demonstrates the power of our technology. We know what the correct step is, and normally we wait for the student input so that we can compare it against the correct step and guide the student appropriately.)
Click here to run the Prim demo. You
need to have a recent version of Java installed. If you have problems
launching the demo, you need to get the latest Java.
For more information about the LPP2007 project, check out our wiki. (Guest login: lpp_guest. Password: Eva24Mark)