Module: Midterm Exam 2

Learning Outcomes

Learn about the Java programming language

The student will:

• Design, develop and test Java programs using polymorphism, inheritance and encapsulation.

Learn the basics and uses of algorithm analysis, including big-O notation

The student will:

• Calculate and explain the big-O runtime of Java code.

Use standard libraries or packages as well as advanced object-oriented programming techniques

The student will:

• Use polymorphism, inheritance, and encapsulation in substantial Java programs, when appropriate reusing and extending previously created classes.

Learn about and implement standard algorithms for sorting arrays

The student will:

• Distinguish between and implement O(n²) sorting algorithms.

• Distinguish between and implement O(nlogn) sorting algorithms.

Learn about and understand the Array data structure.

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.

Learn about and implement the List data structure

The student will:

• Implement two different versions of the List interface.

• Explain the trade-offs between the two different implementations.

Understand Java collection classes and the basics of memory management

The student will:

• Describe the different Java collection classes.

• Explain and compare the basics of memory management in different implementations.

Learn about and implement the Stack data structure

The student will:

• Explain standard interface for a Stack.

• Implement two different versions of the Stack interface.

• Compare the trade-offs between the two different implementations.

Learn about and convert between prefix, infix, and postfix notation

The student will:

• Explain the differences between prefix, infix and postfix notation.

• Implement code to process prefix, infix and postfix equations.

• Compare the trade-offs between the notations.

Learn about and implement the Queue data structure

The student will:

• Implement several different versions of the Queue interface.

• Compare the trade-offs between the two different implementations.

Understand recursion and how to develop recursive algorithms and programs

The student will:

• Use recursive algorithms to solve different problems.

• Write correct recursive Java code to solve different problems.

Readings

Experiential Learning

Assessments

Midterm 2

Midterm

Outcomes assessed: Learn about the Java programming language, Learn the basics and uses of algorithm analysis, including big-O notation, Use standard libraries or packages as well as advanced object-oriented programming techniques, 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, Learn about and implement the Stack data structure, Learn about and convert between prefix, infix, and postfix notation, Learn about and implement the Queue data structure, Understand recursion and how to develop recursive algorithms and programs