| Learning goals |
- Create unit tests to validate whether a module works as intended. 18%
- Implement algorithms expressed in pseudo-code. 12%
- Select algorithms based on algorithmic time/space complexity. 12%
- Knows how and when to use arrays (lists), maps (dictionaries), linked lists and trees. 12%
- Effectively use recursive functions. 12%
- Use backtracking to find optimal solutions to a class of problems. 12%
- Use graphs to store and process data. 12%
- Understand, implement and use sorted data structures such as trees and heaps. 12%
|
|---|