Date: Tue, 10 Dec 1996 22:27:07 GMT Server: NCSA/1.4.2 Content-type: text/html Last-modified: Tue, 03 Dec 1996 03:19:38 GMT Content-length: 3881
Opsis is a Java applet designed to teach binary search tree algorithms. Opsis is not an animation program; rather, the system uses visual programming in an abstract way. That is, the student implements a binary search tree algorithm by manipulating abstract tree fragments (and not necessarily just single nodes) in a visual manner. Opsis is unique in that it combines elements of programming, proof, and animation to enhance the learning experience.
You might want to see some Screen Snapshots of Opsis first.NOTE: I recommend using Netscape 3.0 (or higher) for best results. As Opsis is a Java applet, you won't be able to load or save files with your browser due to security restrictions. If you would like an application version that can load and save files, then please subscribe to the Opsis channel at http://trans.havefun.com:5282. You can pick up the "tuner" program necessary to receive this channel by clicking on the "Tune In Now" graphic.
As this software is rather unconventional, I strongly recommend that you read the documentation!
If you have comments, suggestions, or bug reports, please send them to: amir@cs.washington.edu.
To start Opsis, press the button above (which will only appear if you have a Java capable browser). The applet may take a minute or two to start up. Please be patient.
I have found some Java JDK bugs which affect Opsis; these bugs are listed in the Known Problems page. In any case, if you encounter bugs, please let me know. Warning: Opsis may crash when running on the UNIX version of Netscape; however, it seems to work fine with the Castanet Tuner running under UNIX.
Here is a description of Opsis written for my VL '96 demonstration: (contains snapshots of splay and AVL tree algorithms)
Amir Michail. Opsis: A Java Applet for Teaching Binary Tree Algorithms. [ HTML / Acrobat / Postscript / zip'd Postscript / gzip'd Postscript ]
Here is a paper I have written on the system:
Amir Michail. Teaching binary tree algorithms through visual programming. In Symposium on Visual Languages, 1996. [ HTML / Acrobat / Postscript / zip'd Postscript / gzip'd Postscript ]
Finally, here are the Powerpoint slides for my VL '96 talk: (warning this file is 28 megs uncompressed)
VL 96 slides, PowerPoint 4.0 Win/Mac. [ Download VL96.zip ]