From 8eed991b04520497e5f70f3612189ee365a592d4 Mon Sep 17 00:00:00 2001 From: Romain Vuillemot <romain.vuillemot@gmail.com> Date: Tue, 26 Sep 2023 08:23:30 +0200 Subject: [PATCH] syllabus updates --- README.md | 16 +++++++--------- 1 file changed, 7 insertions(+), 9 deletions(-) diff --git a/README.md b/README.md index 0b496ec..31fb64a 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 -- GitLab