Advanced Algorithms
Exercise and practical sessions for the INP Prépa 2 students of ISIMA.
Term: Fall
Schedule
| # | Topic | Materials |
|---|---|---|
| 1 | Exercise session 1 Solve the longest increasing subsequence problem using a recursive algorithm and then using dynamic programming. | |
| 2 | Practical session 1 Solve the longest increasing subsequence problem using dynamic programming, then improve the complexity to pass all test cases. | |
| 3 | Practical session 2 Solve the minimum loss problem using binary search. | |
| 4 | Exercise session 2 Solve the coin change problem (minimum number of coins) using a recursive algorithm and then using dynamic programming. | |
| 5 | Practical session 3 Solve the coin change problem (number of ways) using dynamic programming. |