- AV Catalog
- Field Reports
- For Developers
- OpenDSA Project
- Getting Started
- Newsletter #1
Field Reports are meant to give instructors an opportunity to report actual experiences with speciﬁc AVs in speciﬁc course settings.
|Author||AVs used||Teaser||Posted||Last updated||Views|
|Using graph visualization with code.||chelwig||
This visualization is one of ﬁve that was used as a mini-tutorial in a Data Structures III class. Last...
|2009-09-23 08:53||2011-05-05 13:02||2,202|
|Use of animations in a CS 2 course||clancy||
Activities involving the two cited visualizations were part of our lab-centric data structures and programming methodology course,...
|2009-08-21 13:00||2011-05-05 12:57||1,927|
|Data structures lab on singly-linked lists||furcyd||
This one-hour lab activity takes place after students have attended lectures on linked lists and how to build them using C++ pointers. Students...
|2009-08-14 22:56||2011-05-05 12:42||1,655|
|CS1 activity on 1D arrays and FOR loops||furcyd||
Students are actively engaged while practicing 1D array traversals using FOR loops. This activity takes place during...
|2009-08-16 11:55||2011-05-05 12:45||1,755|
|jGRASP and CS2||huss||
I heavily used jGRASP and Duane Bailey’s freely available book Java...
|2011-08-07 18:17||2011-08-08 10:35||3,457|
|MST and Dijkstra animations at a German Hochschule||mcclung||
The students were asked to view three animations, Kruskal and Prim for MST and Dijkstra for shortest-path, before...
|2011-05-19 06:55||2011-05-20 13:39||1,773|
|Data structures assignment on graphs in which students construct AV of deadlock detection algorithm||naps||The AV engagement taxonomy speciﬁes four active levels of learner engagement with AV...||2009-08-10 16:07||2009-08-10 16:07||3,307|
|Tutorials for graph algorithms using two differnt AV viewers||naps||A collection of visualization-based tutorials on graph algorithms (...||2009-08-10 21:26||2009-08-10 21:26||1,769|
|Teaching the universal Turing machine||pilucrescenzi||
The goal of these lectures (6 hours in 2006 and 3 hours in 2007) was to teach the students how to fully construct a universal Turing machine...
|2009-08-21 03:38||2010-11-22 13:59||2,213|
|Programming nondeterministic pushdown automata||rodger||
In this lecture, students ﬁrst learn about pushdown automata. Then the instructor uses JFLAP...
|2009-08-09 17:10||2010-06-27 11:18||2,504|
|Interactively experimenting with finite state machines||rodger||
In this lesson, we ﬁrst introduce the formal deﬁnition of a deterministic ﬁnite automaton (DFA)...
|2009-08-09 17:40||2010-06-27 11:18||1,574|
|Interactively learning SLR Parsing and how it fits in with automata theory||rodger||
This lesson shows how deterministic ﬁnite automata (DFA), pushdown automata (PDA) and...
|2009-08-09 18:01||2010-06-27 11:18||3,353|
|Interacting with L-Systems||rodger||
L-systems are a different type of grammar than the formal language grammars in an automata theory course, so they are good for students to see...
|2009-08-09 18:16||2010-06-27 11:18||1,675|
|Learning Turing Machines interactively||rodger||
This lesson describes Turing machines formally and then uses JFLAP to interact with them. The lesson starts by...
|2009-08-09 18:30||2010-06-27 11:20||2,100|
|Interactive Hashing Tutorial||shaffer||
This tutorial was used as part of a quasi-experiment to compare the pedagogical effectiveness of the tutorial as compared to standard textbook/...
|2009-05-27 23:13||2010-06-27 11:17||3,056|
|Lecture and Study Aides for Data Structures Class||shaffer||
A series of AVs were used throughout the course of the semester course. Mostly they were intended as supports for lecture, and many were only...
|2011-05-06 22:05||2011-05-16 17:05||1,782|
|Tutorial for priority queues and binary heap||ville||
A tutorial on priority queues and binary heap was used on two different courses, one at Helsinki University of Technology and one at the...
|2009-08-21 08:13||2010-06-27 11:24||2,939|