| Name |
|---|
| 01. Programming Fundamentals Final Exam Retake |
| Recursion and Combinatorial Problems - Exercise |
| Searching, Sorting and Greedy Algorithms - Lab |
| Graph Theory, Traversal and Shortest Paths - Exercise |
| Introduction to Dynamic Programming - Lab |
| Introduction to Dynamic Programming - Exercise |
| Exam Preparation |
| 9 Class - Exam - 08 October 2021 |
| Graphs Bellman-Ford Longest Path in DAG - Exercise |
| 10 Class - Exam - 2 octomber 2020 |