JFLAP
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Non-Commercial |
||||
Language |
English |
||||
Author |
Susan Rodger |
||||
Institution |
Duke University |
||||
Project |
JFLAP |
||||
Works |
Yes |
||||
Description |
JFLAP allows one to experiment with many topics including automata (finite state machines, pushdown automata, Turing machines), grammars (regular, context-free, unrestricted), l-systems, parsing (LL, SLR, brute force, CYK) and many proofs such as converting an NFA to a DFA to a regular expression. There is an online tutorial on the JFLAP site. |
||||
Evaluation |
Has won best software awards. |
||||
|
|||||
Teaching the Concept; Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2009-08-07 |
||||
Last Visited |
2009-08-07 |
||||
Last Updated |
2008-07-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Trakla - Heap Tutorial
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Mikko Laakso; Ari Korhonen; Ville Karavirta |
||||
Institution |
Helsinki University of Technology |
||||
Project |
|||||
Works |
Yes |
||||
Description |
A complete tutorial for Binary Heaps. The viewer should first read the short tutorial on several topics related to binary heap such as ADT priority queue, array representation of binary heap, MinHeap vs. MaxHeap, etc. and then solve the visual algorithm simulation exercises dealing with Insert, DeleteMax, BuildHeap and finally HeapSort algorithms. The exercises are implemented as Java applets and they provide immediate feedback on the correctness of the simulation. The exercise can be solved with many inputs until the algorithm is mastered. See also the model solutions, which include algorithm animations. |
||||
Evaluation |
|
||||
Canned Data; Predictions |
|||||
Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|||||
The link above takes you to a table of contents for the topics covered by the tutorial. As you work through the topics, you will come to various exercises implemented as Java applets. For each exercise, clicking on the "instructions" tab gives brief instructions on what to do. For example, the heap building exercise requires that you swap values in the tree or array, and in the right order, to build the heap. You can see what the correct series of steps would be by clicking on "Model Answer". You can have the system tell you how well you did by clicking on "Grade". |
|||||
First Visited |
2009-08-31 |
||||
Last Visited |
2009-08-31 |
||||
Last Updated |
2009-08-13 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
