Learning Outcomes

This page collects together all of the “outcomes” associated with individual modules. Outcomes identify what students will know and be able to do if they master the material.

Design and implement simple Java programs.

Write Java code with arrays, iteration, conditionals, strings.
Write Java code that performs simple input and output.

Referencing modules: Java Review

Analyze program complexity using Big O notation.

Calculate and explain Java runtime via Big O notation.

Referencing modules: Big-O Notation

Use object-oriented techniques in program construction.

Use polymorphism, inheritance, and encapsulation.
Reuse and extend previously created classes.

Referencing modules: OOP and Class Hierarchies

Implement standard sorting algorithms on arrays.

Understand trade-offs between array and linked list implementations for sorting.
Characterize sorting algorithms using Big-O notation.
Implement standard sorting algorithms in Java.

Referencing modules: Simple Sorting Algorithms

Implement and use the List data structure correctly.

Implement alternative versions of the List interface.
Use the Iterator and Iterable interfaces.
Understand trade-offs between different implementations.

Referencing modules: Lists

Implement and use the Stack data structure correctly.

Implement alternative versions of the Stack interface.
Use prefix, infix, and postfix notation.
Understand trade-offs between different implementations.

Referencing modules: Stacks

Implement and use the Queue data structure correctly.

Implement alternative versions of the Queue interface.
Understand trade-offs between different implementations.

Referencing modules: Queues

Implement and use recursion correctly.

Implement recursive programs to solve problems.
Understand trade-offs between recursive and iterative implementations.

Referencing modules: Recursion

Implement and use the tree data structure correctly.

Understand the standard structure of a tree.
Implement binary trees.
Implement the binary search tree algorithm.

Referencing modules: Trees

Implement and use the hash table data structure correctly.

Implement two different versions of a hash table.
Understand difference between open addressing and chained maps.

Referencing modules: Hash Tables

Implement and use complex sorting algorithms correctly.

Implement and use heap, merge, shell, and quick sorts correctly.
Understand performance trade-offs for each of these sorting algorithms.

Referencing modules: Complex Sorting Algorithms