Melbourne/Monash Education Technology Collaborative Project

A Flexible Framework Linking Modular Activities in a Multimedia Tool for Learning Algorithms

Linda Stern, Lee Naish, Rod Worley, and David Albrecht

Project MMTAL-09-2000

The aim of this project was to develop the following animations to assist the teaching of computer science algorithms and data structures. The animations are linked to generic computer code (pseudocode) and line-by-line textual explanation. As students step through an algorithm, the relevant line of pseudocode is highlighted and, at the same time, the animation shows the data movement resulting from executing of that step. The animations are organised such that the main ideas are presented first, with successive levels of detail being available to the student on demand.

Animations

Your browser will have to be enabled for java and javascript for the animations to work. Note that you may have to move your mouse for loading of the algorithm to proceed. When you start up the software, four windows will appear.

Sorting Algorithms

• Bubble Sort
• Insertion Sort
• Selection Sort
• Merge Sort
• Quick Sort

Graph Algorithms

• Graph Search Algorithms
• Minimum Spanning Tree Algorithms

Data Structures

• Binary Search Tree (recursive)
• Binary Search Tree (iterative)
• Digital Search Tree
• Radix Trie
• Patricia Trie
• Skip List

All the animations use the Algorithms in Action (AIA) software developed at Melbourne University.