Demonstrate your mastery of OOP, Big O, and Lists.
Dates: Sat, Feb 19 - Sat, Feb 26
The student will:
The student will:
The student will:
The student will:
Distinguish between and implement O(n2) sorting algorithms.
Distinguish between and implement O(nlogn) sorting algorithms.
The student will:
Use Arrays as the underlying data structure for different ADT implementations.
Explain the trade-offs between an array vs. Linked implementation of the ADTs.
The student will:
Implement two different versions of the List interface.
Explain the trade-offs between the two different implementations.
The student will:
Describe the different Java collection classes.
Explain and compare the basics of memory management in different implementations.