Exam 2 is Wed Nov 11. It will cover all material from Day 16 up to and including Day 29. The exam will be during normal class time in our same room and will be very similar in format to exam 1.
Look through these exercises. Similar to the last exam, I might ask you to write some pseudocode implementing one of these methods, especially problems 7 through 12 which I could ask you about for any of the list structures, including skiplists from chapter 4. Or, I might give you some pseudocode for one of these methods and ask you to compute its running time and then improve it.
Very similar to the above, but these exercises on trees or treaps. Again, I could give you some code to implement a tree operation and ask you to anaylize it, or ask you to write some pseudocode for an operation (like I did for extract_min in the exercises).
I'll ask some question about shared_ptr and weak_ptr. For example, I could give you some code and ask if it will be correctly deallocated. Or I could give you some broken code and ask you to fix it. Or just a short-answer type question asking you to describe what shared and weak pointers are.
There will be something about unions and tagged unions. Again, either ask you to give a few lines of code, describe what some C++ code I give you actually does, or a short-answer type problem.