1. 1 Week 9 A little more GUI, and threads. Objectives: Discuss the Swing set of classes. Incorporate animation into applets. Define the term thread. Explain how and why an applet would use multiple threads. Write a Java program that uses multiple threads. Describe the thread life cycle.

2. 2 Week 10 We introduce Data Structures. Objectives: Define Collection and Abstract Data Type. Explain how a class represents a data type. Differentiate static and dynamic data structures. Explain the linked list data structure. Write a program that uses a linked list implementation for a collection. Add methods to a linked list class.

3. 3 Week 11 We continue with Data Structures and review Recursion. Objectives: Discuss variations of a linked list including singly, doubly, and circularly linked lists. Distinguish queues and stacks schematically. Code implementations for queues and stacks. Discuss other types of data structures. Identify requirements for recursion. Solve simple problems using a recursive solution.

4. 4 Week 12 We continue with Recursion and introduce Algorithm Analysis Objectives: Solve some classical problems using recursion. Discuss and estimate the cost associated with recursion. Explain the term tail recursion. Eliminate tail recursion from a recursive method. Explain the meaning of cost when discussing algorithms. List problems associated with analyzing algorithms empirically. Estimate the growth rate of various algorithms including linear search and binary search.

5. 5 Week 13 Algorithm Analysis and Sorting Algorithms. Objectives: Explain what is meant by Big Oh Notation. Use Big Oh Notation to describe growth rate given a function T(n) that describes running time in terms of input size, n. Describe and implement various sorting algorithms including O(n) sorts (bubble sort, selection sort, insertion sort), as well as shell sort, quick sort, and radix sort. Discuss the growth rates associated with various algorithms. Define what is meant by a stable sorting algorithm and identify sorting algorithms that are stable.