diff --git a/README.md b/README.md
index 985da0f3cf2e1e3b2074cb913ef877c00484f918..f7f86fc200d9b28737a3085d7b4432d3f5b050b2 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,49 @@
 # UE5 Fundamentals of Algorithms
 
 Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
+
+## Course Description
+
+- Basis of algorithms (sorting, search) and data structure (arrays, lists)
+- Justification of the choice of data structures
+- Calculate the complexity of an algorithm
+- Optimize algorithms
+- Writing programs using algorithms
+
+
+
+## Outline
+
+📖 == expected reading beforet the class day
+
+1. **Data structures and complexity** - [notebook](01-introduction.ipynb), [slides (pdf)](01-introduction.ipynb)
+
+- 📖 [Python for Everybody](pythonlearn.pdf) chapter 8 (lists), 9 (dictionnaries), 10 (tuples)
+
+2. **Recursion** - [notebook](02-recursion.ipynb), [slides (pdf)](02-recursion.ipynb)
+
+- 📖 [Think Python](thinkpython2.pdf) chapter 5 (Conditionals and recursion))
+
+3. **Stacks and Queues**
+
+4. **Sorting**
+
+5. **Hashing**
+
+6. **Trees**
+
+7. **Trees and their representation**
+
+8. **Tree Algorithms**
+
+9. **Binary and n-trees**
+
+10. **Graphs**
+
+11. **Divide and conquer Programming**
+
+12. **Dynamic Programming**
+
+13. **Greedy Algorithms**
+
+14. **Graphs shortest path algorithm**
\ No newline at end of file
diff --git a/pdf/pythonlearn.pdf b/pdf/pythonlearn.pdf
new file mode 100644
index 0000000000000000000000000000000000000000..109322d61ac73a0d7074d76e77a9ca8534723365
Binary files /dev/null and b/pdf/pythonlearn.pdf differ
diff --git a/pdf/thinkpython2.pdf b/pdf/thinkpython2.pdf
new file mode 100644
index 0000000000000000000000000000000000000000..b7566c2e0a0e6e0082e53279c7bbb1c68cb51804
Binary files /dev/null and b/pdf/thinkpython2.pdf differ