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.
Midterm Exam 1
| Asymptotic Analyis Review | PostScript | |
| List Review | PostScript | |
| Stack and Queue Review | PostScript | |
| General Tree Review | PostScript | |
| Binary Tree Review | PostScript | |
| Binary Search Tree Review | PostScript | |
| Asymptotic Analyis Review | PostScript |
| PQ, Binary Heap, Leftist Heaps | PostScript | |
| Hashing | PostScript | |
| Splay Trees | PostScript | |
| Red-Black Trees | PostScript |
| Hashing | PostScript | |
| SkipLists | PostScript | |
| Graphs | PostScript | |
| Disjoint Sets | PostScript | |
| B-Trees | PostScript |