Topics to be included on the first examination include, but are not 
necessarily limited to, the following:

1. Recursion
2. Arrays, one and two dimensional
3. Dynamic allocation, new and delete, malloc and free, one and two dim.
4. Abstract data types, generalizations
5. Stacks, generalizations, implementations, applications
6. Linked lists, generalizations, implementations, applications
7. Deque, generalizations, implementations, applications
8. Queue, generalizations, implementations, applications
9. Computational complexity, definitions, theorems, "big Oh", "big Omega"
10. Computational complexity, classification of algorithms