JHAVÉ - Dynamic Programming - Edit Distance
|
- Works?
- Yes
- Delivery Method(s)
- Java Web Start
- Project
- JHAVÉ
- Project Relationship
- Part of project
- Language(s)
- English
- Tom Naps
- Institution(s)
- University of Wisconsin - Oshkosh
- Activity Level(s)
- Canned data, Questions, Step control, User data
- Source Code License
- Licensed under Creative Commons
- First Published
- N/A
- Last Modified
- N/A
- Description
- Visualization for solving the minimum edit distance problem using dynamic programming.
- Evaluation
- The AV is set up as a series of “slides” in one pane, and pseudocode in the adjacent pane. As the user steps through the “slides”, the associated pseudocode is highlighted. Occasional questions pop up for the user to answer. This AV has some supporting explanatory information, but it really needs some additional support such as a lecture or textbook content.
- Usage Notes
- Clicking on the link above will take you to a login page for Jhave. If you do not want to create an account at jhave.org, use anonymous@anonymous.com as your user name and anonymous as your password when you are asked to login. You will then be taken to the Jhave page for this AV. Some Jhave AVs include a tutorial on how the AV itself or the underlying algorithm works. At the bottom are links to the AV (you can run it with a built-in quiz system on or off). The first time you try to run any Jhave exercise, you will have to download the Jhave webstart application. This should happen automatically when you click the link. (You might need to install Java !WebStart if it is not on your machine.) Once you download the Jhave application, the AV should start automatically. You can then step through the AV by repeatedly clicking the right arrow button. Occasionally, you will be given a multiple-choice or short-answer question to answer.
- Field Report(s)
- References
- N/A
- AV of the Day
- No
- Score
- 29
