For Learners using JHAVÉ

The JHAVÉ project is an ongoing and evolving project that is currently developing laboratory resource modules for the following data structure and algorithm topics. A central component is a JHAVÉ-rendered visualization of the algorithm, but a mere visualization without supporting materials does not necessarily lead to learning. Consequently the vision of the JHAVÉ project is to provide each module as a section in a Visualization-based Computer Science Hypertextbook, (a "VizCoSH" by the terminology established in this report of a Working Group convened at the 2006 ITiCSE Conference)

Not all of these lab modules are yet complete. A complete module consists of the following components:

1. A hypertext page that provides a textbook-like description of the algorithm. In addition to this standard text-book like description of the algorithm, you will find a link to ...
2. A JHAVÉ-rendered visualization of the algorithm. These links are typically provided in the section of the hypertext page in (1) that we call "Explore the algorithm ..." This visualization will include pop-up questions that are designed to test how well you understand the algorithm being portrayed. Typically such question will ask you to predict what will happen in the next step of the algorithm's execution. In addition to these pop-up questions, the right side of the JHAVÉ environment is augmented with two tabs called "Pseudo" and "Info".
3. The pseudo tab contains a pseudocode description of the algorithm that is synchronized with the graphics that depict the in the left pane of the environment.
4. The info tab contains additional documentation about the algorithm. Oftentimes we use this documentation to explain how the graphics being displayed in the left pane comprise a "picture" of the state of the algorithm.

Since not all of the modules are complete, the list below provides a "legend" for each module that describes the components that are currently available. This legend consists of three "codes":

• The first code describes the availability of the hypertext page that describes the algorithm (1 in the preceding list).
  • The code "H" means that a relatively complete description is available and that the visualization is launched from a link in the page in the "Explore the algorithm" section.
  • The code "MH" means that a skeletal hypertext page is available out of which the visualization is launched, but a thorough description of the algorithm does not yet appear in that page.
  • The code "NH" means that no hypertext page yet appears. Instead all that we have is the visualization itself, which is launched directly from the link to it on this page rather than a link in the "Explore ..." section of the hypertext page.
• The second code describes the availability of synchronized pseudocode (item 3 in list above) for the visualization of the algorithm - "P" if pseudocode is available and "NP" if it isn't.
• The third code describes the availability of accompanying supplemental documentation in the Info tab of the JHAVÉ viewing environment (item 4 in list above) for the visualization of the algorithm - "I" if this additional documentation is available and "NI" if it isn't.

This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License.