导航蓝色风格图案PPT

Frames of this animation follow...
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
EXIT
Conceptual View
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
<>
PREVIOUS MODULE CONTENTS
NEXT MODULE
EXIT
© IIS Lab, Auburn University
Detailed View
© IIS Lab, Auburn University
<>
PREVIOUS MODULE CONTENTS
NEXT MODULE
EXIT
Detailed View
Clicking on the Show Me button will make these four panes come alive!
The Control Panel button allows the learner to change various aspects of the animation (see next slide). For example, the animation speed can be changed, its “chunking level” (where it pauses) can be altered, the learner can choose to run the animation with his or her own data, and the sorting order can be switched (ascending or descending).
© IIS Lab, Auburn University
<>
CONTENTS
EXIT
Architecture
Animated analogy illustrating algorithm’s core operations
Verbal explanation of algorithm’s core operations
<>
CONTENTS
NEXT MODULE
EXIT
Conceptual View
Clicking on the Show Me the Next Pass button will start an animation in which the second person in the line asks the question “who is shorter than me?”.
EXIT
Conceptual View
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
EXIT
Conceptual View
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
EXIT
Conceptual View
Each algorithm visualization in HAlVis is structured as three main modules and two supporting modules. The first module (Conceptual View) explains the core operations of the algorithm and illustrates them using a familiar, real-world analogy. For instance, the analogy for the Selection Sort algorithm shows a line of people that sort themselves by height. The second module (Detailed View) first presents, side-by-side, the pseudocode description and textual explanation of the algorithm. Technical terms in this explanation are hyperlinked to definitions and additional illustrations of fundamental algorithmic principles in a supporting module (Fundamentals). Subsequently, four representations are presented simultaneously one is a detailed animation of the operation of the algorithm on a small data set; the second is the pseudocode of the algorithm in which steps are highlighted synchronously with the animation; the third is a verbal explanation of the events occurring in the animation, and the fourth is a scoreboard of variables. The third module (Populated View) presents an animation of the algorithm's operation on a much larger data set. It also allows the user to make predictions about parameters of the algorithm's behavior and compare these against actual values. This facility and questions provided by a supporting module (Questions) are intended as self-assessment tools for the learner.
Execution Animation (upper left): shows the algorithm’s operation on a small data set using a micro-level animation.
Algorithm Pseudocode (upper right): steps are highlighted in red, synchronously with the animation.
Each person down the line answers this question.
Each one who is shorter will trade places with the first person.
Frames of this animation follow...
<>
CONTENTS
A detailed animation of the algorithm
Animation steps highlighted in pseudocode
Variable scoreboard
Verbal explanations of events in the animation
<>
CONTENTS
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
EXIT
Detailed View
The Detailed View contains a textual presentation explaining the algorithm’s pseudocode, as the next slide shows.
>
EXIT
Contents
Go HAlVis Architecture Go Analogical Description Go Detailed Look Go Algorithm in Action Go Questions
© IIS Lab, Auburn University
<>
EXIT
百度文库
Architecture
Fundamentals
© IIS Lab, Auburn University
<>
PREVIOUS MODULE CONTENTS
NEXT MODULE
EXIT
Detailed View
Next, the Detailed View presents a panorama of the algorithm’s behavior on a small data set, as the following slide shows. This window is divided into four panes:
NEXT MODULE
EXIT
© IIS Lab, Auburn University
Conceptual View
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
EXIT
Conceptual View
© IIS Lab, Auburn University
<>
PREVIOUS MODULE CONTENTS
NEXT MODULE
EXIT
© IIS Lab, Auburn University
Detailed View
© IIS Lab, Auburn University
<>
PREVIOUS MODULE CONTENTS
NEXT MODULE
EXIT
Pseudocode representation of the algorithm
Fundamentals
Verbal explanation of pseudocode steps
A broad animation of the algorithm
Questions
Predicting behaviors and comparing against the animation
HAlVis Selection Sort Example
Hypermedia Algorithm Visualizations
Intelligent & Interactive Systems Laboratory Computer Science & Software Eng. Dept. Auburn University
This explanation is hyperlinked to additional multimedia illustrations in a Fundamentals module. The slide after the next illustrates this by showing what happens if the learner clicks on the hyperlink swap.
EXIT
© IIS Lab, Auburn University
Conceptual View
© IIS Lab, Auburn University
<>
CONTENTS
NEXT MODULE
EXIT
Conceptual View
Clicking on the Show Me the First Pass button will start an animation in which the first person in the line asks the question “who is shorter than me?”.
Each person down the line answers this question.
Each one who is shorter will trade places with the first person.
This repeats for every person except the last.
Execution Variables (lower left): shows the changing values of important variables as execution proceeds.
Execution Status Messages (lower right): provides explanatory messages about events in the animation.