Demonstrate your mastery of OOP, Big O, and Lists.
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.
Midterm
Outcomes assessed: Learn about the Java programming language, Use standard libraries or packages as well as advanced object-oriented programming techniques, Learn the basics and uses of algorithm analysis, including big-O notation, Learn about and implement standard algorithms for sorting arrays, Learn about and understand the Array data structure., Learn about and implement the List data structure, Understand Java collection classes and the basics of memory management
This assessment will verify that students understand the basics of OOP, Lists, Big-O notation and Quadratic Sorting Algorithms. (Excellent 100 - 95, Satisfactory 95 - 85, Borderline 80 - 85, Unsatisfactory < 80)