Students successfully completing this course will demonstrate that they can:
- Use indirection (pointers) to implement dynamic, generic container classes (e.g., vectors, lists, stacks, queues, trees, etc.).
- Design, create, and use unit-tests to test the correctness of data structure operations.
- Design and implement recursive data structure operations.
- Analyze, categorize, and compare the complexity of data structure operations using "big-oh" notation.
- Apply and use object-oriented techniques such as encapsulation, inheritance, and polymorphism.
- For select algorithms, use simple parallel computing techniques to improve algorithm performance and measure the improvement.
