CS 132 Exam 2

1. Chapters 7-11.
2. There will be no online component.
3. Classes: I will ask you to fill in function bodies. If you do something recursively, include the complete code for any helper functions.
4. Stacks: bodies for linkedStackType.
5. Queues: bodies for queueAsArray.
6. Simulation: I might ask what changes you would make for different patterns of handling customers.
7. Searching and sorting: I want you to know how the different searches and sorts work and their order, but will not ask for code.
8. Trees: mostly recursive functions, none of the messy other ones.
9. Heaps: how they work, no code.
10. Best strategy: look over slides, class examples, and weekly assignments.