Question | Mark |
1. Complexity, Efficiency [10 marks] | |
2. Skiplists [10 marks] | |
3. Heaps [10 marks] | |
4. AVL trees [10 marks] | |
5. Self-Organizing Lists and Caching [10 marks] | |
6. Sparse Tables [10 marks] | |
7. Graph Traversals: DFS, BFS [10 marks] | |
8. Spanning trees [10 marks] | |
9. Shortest paths [10 marks] | |
10. Hash tables [10 marks] | |
Total [100 marks] |