diff --git a/README.md b/README.md
index 6a7fc14..f641838 100644
--- a/README.md
+++ b/README.md
@@ -3,6 +3,13 @@
 Exercise generation and helpful materials for the course Introduction to Algorithms and Data Structures.
 Developed by students from the Technical University of Munich primarily for fellow students.
 
+Some of the Exercises TUMGAD can generate:
+- AVL-Trees
+- (a,b)-Trees
+- Binomial Heaps
+- Dijkstra's Algorithm
+- ...
+
 You can check the generator status (which exercises is TUMGAD capable of generating) [here](https://github.com/users/SebastianOner/projects/1)
 ## About
 TUMGAD is a tool for anyone wanting to learn about some the most famous Algorithms and Data Structures, though it 
@@ -12,7 +19,7 @@ Furthermore, it was created using Lecture Resources of the TUM provided in the s
 semester of 2019 as well as the Book [Algorithms and Data Structures: The Basic Toolbox](https://www.springer.com/gp/book/9783540779773).
 Hence there may be different definitions in this project than you are used to.
 
-Please be aware that this is still very much a work in progress and a lot of things still have to be figured out.
+Please be aware that this is still very much a work in progress.
 
 ### How it works
 In the source code of TUMGAD all the data structures and algorithms are already