Sample presentations (Just three clicks away: download, save and play! Hope you like them)

If you need to generate your own slides for your own datasets, Please contact zhangs@oneonta.edu.

If you find some of our slides useful, please drop me a line at zhangs@oneonta.edu. **We are very open to feedback! So please feel free to contact us with error submissions, suggestions, or anything else.**

Please take a a simple survey to help us to help the community! Thank you! Click here!!! It will help us to improve the project.

New generators, IITG

Suffix tree backward (piloted by faculty, IITG, new, 2012-2013)

Suffix tree forward (piloted by faculty, IITG, new, 2012-2013)

Infix postfix conversion and postfix evaluation (Piloted by Christopher Rudy and the faculty, 2012-2013)

Magic square single even LUX method (Piloted by Christopher Rudy and the faculty, 2012-2013, new IITG)

One to all shortest path problem using Dijstra's algorithm (Piloted by Christopher Rudy and the faculty, 2012-2013, new IITG)

Kruskal's algorithm on the minimum cost spanning tree (Piloted by Troy Lounsbury, 2012-2013, new IITG)

Prim's algorithm on the minimum cost spanning tree (Piloted by Troy Lounsbury, 2012-2013, new IITG)

Floyd–Warshall's algorithm on all to all shortest distances (Piloted by Troy Lounsbury, 2012-2013, new IITG)

frequent Pattern trees (Piloted by Troy Lounsbury, 2012-2013, new IITG)

Longest Common Subsequence(Piloted by Troy Lounsbury, 2012-2013, new IITG)
Previous generators

Heapsort (Piloted by EriK Williams)

Quicksort (Piloted by faculty)

Binary Search Tree (Piloted by Sean Long)

Red Black Tree (Piloted by Faculty)

AVL tree (Piloted by Sean Long )

Magic Square of Odd Sizes (Piloted by Matthew Lagueras)

Magig Square of Doubly Even (Piloted by Matthew Lagueras)
Static Huffman Coding (Piloted by Christopher Fremgen)

Adaptive Huffman coding (Piloted by Faculty)

Breadth First Traversal (Piloted by Christopher Fremgen)

Munkres Job-Cost Analysis (Piloted by Faculty)

MD5 Hashing (Piloted by Christopher Fremgen)

Range coder (Piloted by Thomas Kish)

Cellular Automata (Piloted by Thomas Kish)

A nontrivial graph you do not want to draw but want to use to scare your student. Just kidding. Actually we are developing a set of slides four coloring such graph(Piloted by Faculty)

A Turing machine example, to be refined in summer(Piloted by Thomas Kish)

Using a brute force method to four color a US map (Piloted by Erik Williams)



We believe that Computer Science algorithms can be taught more effectively if CS instructors are given access to easy-to-use teaching materials.

This is a practical approach developed BY undergraduate CS educators and their students FOR undergraduate CS educators and their students to facilitate their teaching and learning of data structures and algorithms. It is an education oriented project aiming to immediately produce teaching materials for CS instructors.

Our Goal
Visualizing how an algorithm works is the best method of understanding an algorithm so we want to give students the chance to efficiently learn algorithms in this manner. Our hope is that this project will immediately enhance and modernize the current practice of algorithm teaching and directly contribute to data structures and algorithms education on a national scale. We plan on creating about 50 generators to help visualize the most fundamental, usually also the most popular, algorithms and data structures that most CS teachers usually teach at undergraduate level CS courses.


What we've done
We have already built several algorithm visualization generators. You can register and request generators for specific algorithms.

Locations of visitors to this page