DescriptionSolve an algorithmic problem.
TypeHand-in assignment with oral explanation.
DurationAt most 1 working day.
Progress points1.0
Test matrix
Learning goal Know Comprehend Apply Analyze Evaluate Create Σ
Create unit tests to validate whether a module works as intended. 17 17
Implement algorithms expressed in pseudo-code. 11 11
Select algorithms based on algorithmic time/space complexity. 11 11
Knows how and when to use arrays (lists), maps (dictionaries), linked lists and trees. 11 11
Effectively use recursive functions. 17 17
Use graphs to store and process data. 11 11
Understand, implement and use sorted data structures such as trees and heaps. 11 11
Use backtracking to find optimal solutions to a class of problems. 11 11
Status You need to log in to view the learning materials and assignment(s).