In particular, your exam may include questions which test your understanding of code and concepts taken from the programming projects you have completed this semeseter.
| Asymptotic Analyis Review | PostScript | |
| List Review | PostScript | |
| Stack and Queue Review | PostScript | |
| Recursion Review | PostScript |
| General Tree Review | PostScript | |
| Binary Tree Review | PostScript | |
| Binary Search Tree Review | PostScript | |
| Splay Trees Review | PostScript | |
| Red-Black Trees Review | PostScript | |
| K-D Trees Review | PostScript | |
| Hashing Review | PostScript | |
| Extensible Hashing Review | ||
| PQ, Binary Heap, Leftist Heaps Review | PostScript | |
| SkipLists Review | PostScript | |
| Disjoint Sets Review | PostScript | |
| B-Trees Review | PostScript |