Introduction to sorting data.
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:
Develop abstract data types.
Use appropriate data encapsulation and information hiding.
Choose, design and develop appropriate tests for their Java code.
The student will:
Understand White and Black box testing.
Choose, design and develop appropriate tests for their Java code.
Quiz 03 Sep 12:00 AM
Outcomes assessed: Learn about and understand the Array data structure., Learn about and implement standard algorithms for sorting arrays, Learn about the Java programming language
This assessment will verify that students understand the basics of BigO analysis.
Quiz 05 Sep 12:00 AM
This assessment will verify that students understand the basics of Quadratic Sorting Algorithms such as:
Assignment
Outcomes assessed: Learn about the Java programming language, Use standard libraries or packages as well as advanced object-oriented programming techniques, Learn about and understand the Array data structure., Learn about and implement standard algorithms for sorting arrays, Be exposed to software engineering techniques, Be exposed to software testing techniques
This assessment will verify that students understand the basics of Big-O notation and Quadratic Sorting Algorithms such as:
The students will implement all three sorting algorithms for arrays of objects.