导航设计PPT模板.ppt

? IIS Lab, Auburn University HAlVis Selection Sort Example Hypermedia Algorithm Visualizations Intelligent Interactive Systems Laboratory Computer Science Software Eng. Dept. Auburn University Contents HAlVis Architecture Analogical Description Detailed Look Algorithm in Action Questions Architecture Architecture Conceptual View Conceptual View Conceptual View Conceptual View Conceptual View Conceptual View Conceptual View Conceptual View Conceptual View Detailed View Detailed View Fundamentals Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Detailed View Populated View Populated View Populated View Populated View Populated View Questions Questions Questions End EXIT PREVIOUS MODULE NEXT MODULE The next module is the Populated View that shows a macro-level animation (without the minute details) of the algorithm’s operation on a large data set. Note three important features: (1) The learner can make predictions about major parameters of the algorithm’s operation and compare his/her predictions against actual values. (2) The learner can choose to see the algorithm operating on worst-case, best-case or randomly distributed data. (3) The learner can adjust the speed of animation at the beginning or while the animation is in progress. CONTENTS EXIT CONTENTS PREVIOUS MODULE NEXT MODULE The following three slides illustrate the Populated View animation. The first slide shows the data to be sorted (worst-case). Note that the learner has made some predictions and selected the slowest speed. The second slide shows a frame from the animation in progress. Note the color coding that conveys information about data items that have already been sorted and those that are currently being considered. The third slide shows the last frame of this animation. Sorting is complete. The learner can now compare the predictions against actual values. EXIT