Algorithms
Practical sessions for the Bachelor's 3 computer science students of ISIMA.
Term: Spring
Schedule
| # | Topic | Materials |
|---|---|---|
| 1 | Practical session 1 Solve the longest increasing subsequence problem using dynamic programming, then improve the complexity to pass all test cases. | |
| 2 | Practical session 2 Solve the minimum loss problem using binary search. | |
| 3 | Practical session 3 Solve the coin change problem (number of ways) using dynamic programming. | |
| 4 | Project In groups of three, solve an algorithms problem with medium dificulty from HackerRank and demonstrate how your solution works in a presentation. |