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 email@example.com.
If you find some of our slides useful, please drop me a line at firstname.lastname@example.org. It will be a great encouragement for us to continue this extrememly coding intensive project!!
Longest Common Subsequence(Piloted by Troy Lounsbury, 2012-2013, new IITG)
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 GoalVisualizing 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.
Our platform for distributing visualization materials of data structures and algorithm is this website. Users can register and request presentations simply by following the input format for each generator
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.
**We are very open to feedback! So please feel free to contact us with error submissions, suggestions, or anything else.**
What we've doneWe have already built several algorithm visualization generators. You can register and request generators for specific algorithms.
How this thing worksIt's simple. Each generator has a page where you can request a presentation. Each generator also has a specific input format. For example, Huffman Encoding just takes a sentence as input where Depth First Traversal takes an XML formatted input. You can view the specific format for each generator on the generator's page.
We appreciate your spiritual support!We recognize that all these samples, the generators that generated these samples, as well as this website itself will/can be further improved. Actually, the generators were fast prototyed by faculty and volunteer student programmers. But with adequate support, student programmers will be hired to refine the current generators and produce new generators for other algorithms! You can support our work by using the materials. We strongly believe that this is going to a practical approach which can immediately benefit any CS instructors who teach these materials. Show your support! Together, let us do something for the CS undergraduate educators. The pilot research was explored by the group members who have been enthuasiastic to this novel approach. As CS educators, you already can tell the proposed project is very programming labor intensive. Each algorithm needs a separate generator, which will be coded by our faculty or capable senior students. If we do not do it, these materials will never exist! We appreciate your support!How can you be of help?There are many ways. You can just adopt the materials for your teaching. You can provide us feedback so we can improve our work. You an also create generators for new algorithms. You can join us in debugging our software. You can also just browse the slides yourself and provide your insightful comments. Your feedback could be helpful to keep us investing more time on this long-term project. Thanks for your support again!