diff --git a/README.md b/README.md
index 0b496ecfdb489f53803af14b65b24d80e8624cd0..31fb64acfed0d101c17ad8b7ffa17ec7d9126d6e 100644
--- a/README.md
+++ b/README.md
@@ -19,21 +19,19 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 
 ### Lecture 2 - **Recursion** | [notebook](02-recursion.ipynb) | [slides](02-recursion-slides.pdf) | [exercices](02-recursion-exercices.ipynb)
 
-📖 [Think Python](pdf/thinkpython2.pdf) chapter 5 (Conditionals and recursion)
+📖 [Think Python](pdf/thinkpython2.pdf) chapter 5 (Conditionals and recursion) and [Real Python](https://realpython.com/python-recursion/).
 
 ### Lecture 3 - **Lists, search, sort** 
 
-📖 [Think Python](pdf/thinkpython2.pdf) chapter 11 (lists), chapter 12 (tuples)
+📖 [Think Python](pdf/thinkpython2.pdf) chapter 11 (lists), chapter 12 (tuples), [Python for Everybody](pdf/pythonlearn.pdf) chapter 8 (lists) and [Real Python](https://realpython.com/python-list/).
 
-📖 [Python for Everybody](pdf/pythonlearn.pdf) chapter 8 (lists)
-
-### Assignment 1 - TBD
+📝 Assignment 1 - Analyzing a Simple Dataset
 
 ### Lecture 4 - **Divide and conquer and greedy algorithms** 
 
 ### Lecture 5 - **Dynamic programming** 
 
-### Assignment 2 - TBD
+ 📝Assignment 2 - Solving a problem with dynamic programming
 
 Next topics:
 
@@ -49,11 +47,11 @@ Next topics:
 
 6. **Binary and n-trees**
 
-8.  **Graphs**
+7.  **Graphs**
 
-9.  **Graphs algorithms**
+8.  **Graphs algorithms**
 
-10.  **Graphs shortest path algorithm**
+9.   **Graphs shortest path algorithm**
 
 ## Books