It shows skills per level and it's not bad !
I.E.:
| Computer Science | |||||
|---|---|---|---|---|---|
| 2n (Level 0) | n2 (Level 1) | n (Level 2) | log(n) (Level 3) | ||
| data structures | Doesn't know the difference between Array and LinkedList | Able to explain and use Arrays, LinkedLists, Dictionaries etc in practical programming tasks | Knows space and time tradeoffs of the basic data structures, Arrays vs LinkedLists, Able to explain how hashtables can be implemented and can handle collisions, Priority queues and ways to implement them etc. | Knowledge of advanced data structures like B-trees, binomial and fibonacci heaps, AVL/Red Black trees, Splay Trees, Skip Lists, tries etc. | |
No comments:
Post a Comment