User's Manual for the Gumbix Algorithm Suite
Contents
1. Eclipse package for sorting This section tells you how to add your own sorting algorithm and run it in the sorting tool The sorting tool itself is described in section 2 3 1 Integration of a new sort algorithm A simple way is to copy or modify the example MeinBubbleSort java found in src Create a new class here MeinBubbleSort that has a main method to run Also create a class that inherits from AbstractIntArraySort this is in our example MeinBubbleSort too Snippet 1 shows the main method and the way how a new algorithm is added An object of type Main is created and the constructor gets the new algorithm and a name passed as parameters This will open the sorting tool and add the algorithm in the Algorithms menu Extending the AbstractIntArraySort requires to implement a sort method Here the array to be sorted is passed in from the sorting tool as an argument The initial array is created as described in section 2 2 Snippet 2 shows an example for the sort method Now you can implement your own sorting algorithm within this method 3 2 Callbacks to the sorting tool The sorting tool needs to know when to refresh the dot plot panel Invoke the me thod currentList anytime when your algorithm has performed a relevant sorting 2 musical instrument digital interface es Re 59 22 Gumbix Algorithm Suite 10 11 2011 Algorithm 1 Adding a new algorithm and starting the sorting tool public static2. soon 5 Grammars 5 1 Overview This tool reads context free grammars and generates all derivation trees up to a given tree depth Note that this tool is still in beta status Especially the error messages are not very helpful Start the demo by running grammartree bat e g by double clicking This will open a similar window like in figure 3 5 2 Grammars A grammar can be loaded using the File Open command The tool understands two grammar formats 2E 59 22 zz Gumbix Algorithm Suite 10 11 2011 Grammar Tree File Tree Depth Layout a a b b Figure 3 Grammar tool overview 1 Backus Naur Form BNF where a file ends with bnf and 2 a standard grammar format where a file ends with grm The directory examples contains a grammar in both styles which generates the words a b n gt 0 Listings 1 and 2 show the grammar This grammar is loaded by default Listing 1 Example in BNF format lt S gt Ma lt A gt a lt A gt b A ge Listing 2 Example in standard format S gt A A gt a A b A The start symbol is always the rule S The empty word is a Constraints A grammar can have only one option per line I e the symbol to indicate alternatives is not yet implemented 5 3 Visualization of the derivation tree The derivation tree is shown in the main panel The derived sentences is displayed on top of the tree Each character is separ
3. void main String args 1 Parameter ist Ihre neue eigene Klasse 2 Parameter ist eine kurze Beschreibung die so sp ter im Menu angezeigt wird Main main new Main new MeinBubbleSort BubbleSort von mir Algorithm 2 sort method protected void sort int array Ab hier k nnen Sie Ihren eigenen Source Code eingeben for int m 0 m lt array length 1 m for int i 0 i lt array length 1 i if array i gt array i 1 int h array i array i array i 1 array i 1 h Mit dieser Anweisung z hlen Sie eine Anweisung in einer inneren Schleife um 1 hoch currentList array INNER Mit dieser Anweisung z hlen Sie eine Anweisung in einer u eren Schleife um 1 hoch currentList array OUTER Bis hier k nnen Sie Ihren eigenen Source Code eingeben 10 11 2011 Gumbix Algorithm Suite Tree Edit View Help 1 2 3 5 6 Figure 2 Overview of the tree tool step The bubble sort in the example above has an inner and outer loop Thus we callback the sorting tool accordingly Caution If your algorithm never calls the currentList method the sorting tool will also never update the sorting process be fore the sorting is done 4 Trees Start the demo by running treeUI bat e g by double clicking This will open a similar window like shown in figure 2 More documentation will follow
4. DOT A En oh obese Peres es Sue I ee Oe Meee WONACH St Soy bh dean bot Pao btn ae ee ce at N N ooo A BR WwW amp ov Ol o NNN o ooo o 539 gt az Gumbix Algorithm Suite 10 11 2011 1 Introduction 1 1 Overview The Gumbix algorithm suite GAS consists of three different packages 1 gumbix algorithms tool 2 sorting algorithms as ready to go Eclipse project 3 grammar tool The 1 gumbix algorithms tool contains two executables for a the demonstration and visualiziation of sorting algorithms and b for different types of search trees 2 The sorting algorithms are applied in a separate Eclipse package This should enable students of the first semesters to integrate their own sorting algorithms into the gumbix algorithm tool Finally 3 the grammar tool draws derivation trees of Backus Naur or context free grammars 1 2 Installation Prerequisite In any case you need a Java Runtime Environment for JDK 1 5 or higher installed on your computer The java command must be in the PATH gumbix algorithm tool Extract the zip file e g gumbix algorithms 1 4 0 zip in a directory on your file system e g under c gumbix algorithms This directory will contain the following files and directories e doc This user manual and other documentation e lib required libraries e sortUI bat Start this batch file to run the sorting demo e tree bat Start this batch file to run the search tree demo al
5. Data shows the options If a list of elements is automatically generated you may specify the size in the menu Data Size beforehand 1 Text field Enter elements manually The input field on the lower left corner lets you enter numbers Each element must be separated by a space 2 Random Creates a list of random numbers Note the size of the list is specified in the menu Data Size as mentioned above 3 Sorted Creates a list of already sorted numbers The sorting order is ascending 4 Reverse Creates a list of descending sorted numbers If elements are entered manually mode Text field the sorting tool can interpret the values in two ways 1 as numbers 2 as strings as they are Select Edit Parse values as numbers to activate option 1 Also if you have created an interesting list e g by creating a random list you may copy the list into the text field where the numbers can be modified further This can be accomplished with the menu Edit Copy current data to edit field 2 3 Options for visualization The menu View contains further options for the visualization Delay Sorted lists are updated permanently when in run mode However this hap pens typically too fast to follow View Delay sets the time interval in ms for a delay Inner and outer loops Typically all sorting algorithms consist of two nested loops sometimes hidden in recursion These loops are denoted as inner and outer loop However looking at the changes w
6. User s Manual for the Gumbix Algorithm Suite Markus Gumbel 2008 2011 Abstract This paper describes the features of the Gumbix Algorithm Suite GAS This suite contains tools for the visualiziation of sorting algorithms and for different types of search trees A ready to go Eclipse project helps to easily add new sort algorithms This should enable students of the first semesters to integrate their own sorting algorithms into the gumbix algorithm tool Finally a grammar tool draws derivation trees of Backus Naur or context free grammars Contents 1 Introduction EE Overviews en cee see bg res be ees be ee 1 2 Installation 2 os u oe eG he a ae vt ee be vo rae fe Sorting 2 1 AO CIVIC W en ote ee A ee RAE Dl es te Yi Oe eo ee gee A e 2 2 Creating data for sorting 2 6 tia bl A pie hed AS Erk ee eM 2 3 Options for visualization wa ee EA ROE RARE Ra DS Dl SOUN iry e pate ht Bohra ee eee ee ee ae ae Be ee 220 SAISON ene ee ee Aa he i gl aa NS ae Ge de Bo Eclipse package for sorting 3 1 Integration of a new sort algorithm 3 2 Callbacks to the sorting tool 44 9 Ho an a a a Oe Trees Grammars Bell OVERVIEW ying a tal a eas Bade inde Ay eS A a Bide Grammars ak kao de ne Seb A ae te Ok eh aed Bk kk ad 5 3 Visualization of the derivation tree 0 0 00084 Ressources Neil Download ss nie ao ia cig he Ot Giggs ie de Goethe a a er Siders te are See ee as 2 90 Date ne
7. ated by a comma The slider on the bottom enables you to browse through all derivation trees Non terminal symbols which are not yet expanded are cut off if the derivation depth exceeds the tree depth They are then simply displayed as a non terminal rule 10 11 2011 Gumbix Algorithm Suite Tree Depth This number represents the depth of the tree which is generated and is specified in the menu Tree Depth Note that many grammars yield a huge number of trees if the depth is greater than 4 Be careful if the number of trees is to high the JVM will run out of memory A Ressources A 1 Download The distributables are available at http www mi hs mannheim de gumbel vorlesungen ads gumbix algorithm suite A 2 Bug report Any software has some bugs and especially this package is definitely not intended to be perfect However if you have found a bug or something that you find weird please let me know and write to m gumbel hs mannheim de An issue tracking system is not yet available A 3 Contact Markus Gumbel Mannheim University of Applied Sciences Department of Computer Science Institute for Medical Informatics m gumbelChs mannheim de or http www mi hs mannhe gumbel
8. gorithms groovy Add your own sorting algorithms here This approach is deprecated so forget about it See section 1 for a better way Eclipse project Extract the zip file e g gumbix algorithms sortext 1 4 0 zip in a directory on your file system e g under c gumbix sortext This directory will contain the following files and directories e doc This user manual and other documentation e lib required libraries e src contains a java file MeinBubbleSort java e classpath and project Eclipse project definition Now import this project into Eclipse Typically via File Import then Existing Projects into Workspace Now read section 3 how to write your own sorting algorithms 1The grammar tool is not part of the gumbix algorithm tool due to technical reasons only gumbix algorithm tool is written in Groovy whereas the newer grammar tool is written in Scala INFORMATIK 10 11 2011 Gumbix Algorithm Suite Algorithm Data Edit View Sound Help 1 3 2 5 4 Sorting 1 2 3 4 5 current unsorted Figure 1 Sorting tool Overview grammar tool Extract the zip file e g grammartree 1 1 0 zip in a directory on your file system e g under c grammartree This directory will contain the following files and directories e doc This user manual and other documentation e examples Example grammars which can be loaded into the grammar tool e lib required libraries e grammartree bat Start this batch file t
9. hile the algorithm processes the inner loop can so metimes be tedious and boring You can tell the sorting tool not to display changes while performing the inner loop by deselecting View Show inner and outer loops Tech nical details on this topics can be found in section 3 2 4 10 11 2011 Gumbix Algorithm Suite Show Index By default the sorting tool displays the index position of the elements However if the lists consists of numbers only it might also display the number s value directly This option is configured in View Show Index Note that if non number values entered in the text field the display mode must be Show Indez 2 4 Sound The sorting process can not only be visualized it can also be well audiolized If you want to hear the list select Sound Play Sound Now a number is interpreted as a MIDI note i e the values must be in range 0 through 127 Note 60 is a Middle C Note that the range 30 to 90 sounds fine for humans Thus if sound is activated the generation of example data is slightly different Now the values are centered around the value 60 i e the note Middle C Caution Playing very long lists say more than 64 elements will take some time Currently there is no way to interrupt the playing except of quitting the program 2 5 Algorithms Finally the menu Algorithm lets you select the algorithm to use The gumbix algorithms tool comes with bunch of already implemented algorithms 3
10. o run the grammar tool 2 Sorting Note If you want to integrate you own sorting algorithm please also read section 3 2 1 Overview Start the demo by running sortUI bat e g by double clicking This will open a similar window like shown in figure 1 Visualization The panel shows a list of numbers which are ready to be sorted The numbers are shown in the first row in their current order Below you see a dot plot where the z axis shows the current index position of an element of the probably unsorted list The y axis shows the index position of the same elements if they were already sorted For instance element 3 in figure 1 is currently at position 1 see z axis and should be at position 2 see y axis if the list was sorted Note that the index positions 3 Re 59 gt az Gumbix Algorithm Suite 10 11 2011 start at 0 So a sorted list would result in a dot plot where all elements are on a diagonal line from 0 0 to n n Running A list can be sorted by running the sort algorithm The Run button starts the execution and stops if the list is sorted i e the algorithm has been completed You may use the Step button to step through the sorting process You can switch between the run mode and the step mode by pressing the Run and Step buttons respectively The Reset Button stops the execution 2 2 Creating data for sorting The sorting tool provides several ways for creating lists to sort The menu
Download Pdf Manuals
Related Search