CS 143 - Computer Science III Java

1. Demonstrate the implementation of the underlying data structures used in computer science, such as the list, set and map implementations using both array and linked node implementations.
2. Describe, implement and debug simple algorithms using the concept of recursion as a tool for data structure implementation.
3. Study complexity and performance tradeoffs using classical algorithms and standard notation such as Big-O.
4. Demonstrate the ability to decompose a large scale process into multiple object oriented classes/interfaces/etc. to make a single unified solution.