TUMGAD semester start release

Initial public release of TUMGAD

The generator

The Generator is as of now able to generate Exercises for the Algorithms:

• APSP (Floyd-Wharshall)
• Dijkstra's shortest Paths
• Graph Traversal (DFS and BFS)
• Hashing (Chaining and Double)
• Mergesort
• Quicksort
• Radixsort

and the Data Structures:

• AVL Trees
• (a,b) Trees
• Binary Heaps
• Binomial Heaps

There are also Descriptions for all of the aforementioned components and more here

Priority Queue Update

What's new?
Implementation and generation for Priority Queues covered in lecture. Namely:

• Binary Heaps
• Binomial Heaps

Search Structure Update

What's new?
Implementation and generation for:

• AVL-Trees
• (a,b) and B-Trees

Graph Traversal Update

New features:

• Exercise Generation for Breadth-First-Search
• Exercise Generation for Depth-First-Search
• Random LaTeX tikz graph generator

New Generators added to TUMGAD

New features:

• Exercise generation for: Double Hashing, Hashing w/ chaining
• Some small layout-improvements in the PDFs

Initial Release

TUMGAD launch release

Features:

• Random exercise and solution generation to PDF for Dynamic Arrays, MergeSort, QuickSort, RadixSort
• Interactive Command Line with option to select only some exercises of interest
• MarkDown descriptions of Algorithms and Data Structures on the web here

Known Issues:

• Dynamic Array throws IOOB Exception on some pop() operations (no correlation to alpha, beta and arraysize has been found)