|
Create unit tests to validate whether a module works as intended.
7
|
|
|
17 |
|
|
|
17.2
|
|
Select algorithms based on algorithmic time/space complexity.
4
|
|
|
5 |
5 |
|
|
9.2
|
|
Knows how and when to use arrays (lists), maps (dictionaries), linked lists and trees.
4
|
|
|
11 |
|
|
|
11.5
|
|
Effectively use recursive functions.
4
|
|
|
10 |
|
|
|
10.3
|
|
Implement algorithms expressed in pseudo-code.
4
6
|
|
|
11 |
|
|
|
11.5
|
|
Understand, implement and use sorted data structures such as trees and heaps.
4
|
|
|
13 |
|
|
|
12.6
|
|
Use backtracking to find optimal solutions to a class of problems.
4
6
|
|
|
13 |
|
|
|
12.6
|
|
Use graphs to store and process data.
4
|
|
|
15 |
|
|
|
14.9
|