Project Description
For the lecture “Algorithms and Data Structures”, I programmed a few learned things with C++. For representation on the Windows App, I used XAML. For most of the examples, default values are generated and inserted to imediately see a possible result.
- Trees
- Natural Binary Tree
- Even Counting Tree
- AVL Tree (Adelson-Velskii and Landis)
- Splay Tree
- Max Heap Tree
- Min Heap Tree
- Fibonacci Heap Tree
- Greedy
- Lists
- Linear List
- Double Linked List
- Move To Front List
- Stack (LIFO)
- Queue (FIFO)
- Hashing
- Dynamic Programming
- Mars Mission (2D tile path finding with highest value)
- Longes Common Subsequence
- Longest Ascending Subsequence
- Knapsack
- Branch and Bound
- Knapsack
- Scanline
- Non Dominated Points
- Convex Hull
- Segment Intersection
My tasks
- Implementation of the algorithms and data structures in C++ and Xaml in Visual Studio.
![[:en]ETH DnA - Overview[:de]ETH DnA - Übersicht[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_00_overview_01.jpg "ETH DnA – Overview")
![[:en]Trees: AVL[:de]Bäume: AVL[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_02_trees_avl.jpg "[:en]ETH DnA – Trees: AVL[:de]ETH DnA – Bäume: AVL[:]")
![[:en]Trees: Fibonacci Heap Tree[:de]Bäume: Fibonacci Heap Baum[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_04_trees_fh.jpg "[:en]ETH DnA – Trees: Fibonacci Heap Tree[:de]ETH DnA – Bäume: Fibonacci Heap Baum[:]")
![[:en]Branch and Bound: Knapsack[:de]Branch and Bound: Rucksack-Problem[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_09_bnb_knapsack_01.jpg "[:en]ETH DnA – Branch and Bound: Knapsack[:de]ETH DnA – Branch and Bound: Rucksack-Problem[:]")
![[:en]Branch and Bound: Knapsack[:de]Branch and Bound: Rucksack-Problem[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_09_bnb_knapsack_02.jpg "[:en]ETH DnA – Branch and Bound: Knapsack[:de]ETH DnA – Branch and Bound: Rucksack-Problem[:]")
![[:en]Scanline: Convex Hull[:de]Scanline: Konvexe Hülle[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_10_scanline_convex_hull.jpg "[:en]ETH DnA – Scanline: Convex Hull[:de]ETH DnA – Scanline: Konvexe Hülle[:]")
![[:en]Scanline: Segment Intersections[:de]Scanline: Segmentschnittpunkte[:]](https://breitmuuufrosch.ch/wp-content/uploads/2019/09/eth_dna_11_scanline_segment_intersections.jpg "[:en]ETH DnA – Scanline: Segment Intersections[:de]ETH DnA – Scanline: Segmentschnittpunkte[:]")
