Field Reports
Field Reports are meant to give instructors an opportunity to report actual experiences with specific AVs in specific course settings.
Submit new Field Report | Field Reports Forum
| Author | AVs used | Teaser |
Posted |
Last updated | Views | |
|---|---|---|---|---|---|---|
| Interactive Hashing Tutorial | shaffer | Interactive Hashing Tutorial |
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 | 775 |
| Programming nondeterministic pushdown automata | rodger | JFLAP |
In this lecture, students first learn about pushdown automata. Then the instructor uses JFLAP... |
2009-08-09 17:10 | 2010-06-27 11:18 | 544 |
| Interactively experimenting with finite state machines | rodger | JFLAP |
In this lesson, we first introduce the formal definition of a deterministic finite automaton (DFA)... |
2009-08-09 17:40 | 2010-06-27 11:18 | 276 |
| Interactively learning SLR Parsing and how it fits in with automata theory | rodger | JFLAP |
This lesson shows how deterministic finite automata (DFA), pushdown automata (PDA) and... |
2009-08-09 18:01 | 2010-06-27 11:18 | 931 |
| Interacting with L-Systems | rodger | JFLAP |
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 | 317 |
| Learning Turing Machines interactively | rodger | JFLAP |
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 | 470 |
| Data structures assignment on graphs in which students construct AV of deadlock detection algorithm | naps | Deadlock detection algorithm | The AV engagement taxonomy specifies four active levels of learner engagement with AV... | 2009-08-10 16:07 | 2009-08-10 16:07 | 848 |
| Tutorials for graph algorithms using two differnt AV viewers | naps | JHAVE AV environment with Matrix and GAIGS plug-ins | A collection of visualization-based tutorials on graph algorithms (... | 2009-08-10 21:26 | 2009-08-10 21:26 | 538 |
| Data structures lab on singly-linked lists | furcyd | JHAVEPOP | This one-hour lab activity takes place after students have attended lectures on linked lists and how to build them using C++ pointers. Students are... | 2009-08-14 22:56 | 2009-08-14 22:56 | 471 |
| CS1 activity on 1D arrays and FOR loops | furcyd | JHAVE (with category = cs221) | Students are actively engaged while practicing 1D array traversals using FOR loops. This activity takes place during the... | 2009-08-16 11:55 | 2009-08-16 11:55 | 497 |
| Teaching the universal Turing machine | piluc | JFLAP |
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-06-27 11:23 | 411 |
| Tutorial for priority queues and binary heap | ville | Trakla2 - Heaps |
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 | 703 |
| 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 | 2009-08-21 13:00 | 402 | |
| Using graph visualization with code. | chelwig | Dikstra Shortest Path Algorithm |
This visualization is one of five that was used as a mini-tutorial in a Data Structures III class. Last year... |
2009-09-23 08:53 | 2009-09-23 08:53 | 690 |
