Error Handling, Personal Project Specifications

(I Object-Oriented Program Design, II Program Implementation, III Program Analysis)

1.      Explain the necessity of error handling in a program.

2.      Write programs capable of throwing exceptions

3.      Correctly use the Assertion mechanism of java.

4.      Explain functional decomposition and abstraction.

5.      Describe top-down design.

6.      Correctly design both interacting classes and an interface.

7.      Be familiar with the above requirements for the Personal Project.

Programming Assignment: Design a short program to demonstrate throwing exceptions and using the Assertion mechanism. The program must have a simple GUI interface with some form of GUI based text input and output.

Assignment: Begin work on the personal project

Chapter 18: Big-O Analysis of Algorithms

(III Program Analysis)

1. State the 2 major requirements of a data structure: 1st, a way to organize the data and 2nd, methods of accessing and manipulating it.
2. Be aware of the 6 different growth functions described on pages 452-453. Correctly use big-O notation for each and give at least one example for each.
3. Be familiar with the rate of growth curve for all of the 6 growth functions referred to above (see Figure 18-2) and be aware that a favorable type may become unfavorable if "n" is changed.
4. Be familiar with best, average and worst case scenarios for the sort algorithms in table 18-1 p.460.
5. Be able to apply big-O notation and analysis to typical algorithms.

Homefun: Read Chapter 18; Exercises 1, 3, 5, 7, 9

Test: Chap 18

Chapter 19: The Java Collections Framework

(IV Standard Data Structures)

1. State what must be imported into a Java program to use the Java Collections. import java.util*;

2.      Be familiar with the Collections<E> interface and the methods listed for it on p.468.

3.      Be aware that Java collections only work with objects.

4.      Describe what has to be done to store primitive data types in a collection.

5.      Explain how autowrapping or autoboxing works in Java 5.

6.      Be familiar with the Iterator<E> interface and the methods listed for it on p. 470.

7.      Be aware that a List is a type of Collection whose elements are arranged in sequence and indexed (starting at 0).

8.      Be aware of the limitations of ArrayList caused by the fact that it is stored in contiguous memory as an array.

·         Adding an element requires moving all the ones with a higher index

·         When the initial size allocation is exceeded, the ArrayList must allocate space for a bigger array and copy all the data to it. (It does this automatically, but it still represents a big overhead).

9.      Describe the double-linked node type structure of the LinkedList and how it solves the contiguous memory problem.

10. State the key drawback of a Linked List. It 's not a random access collection.

11. Describe the term LIFO and relate it to the Stack class.

12. Be familiar with the stack class and the methods listed for it on p. 479.

13. Describe the term FIFO and relate it to the Queue interface.

14. Be familiar with the Queue class and the methods listed for it on p. 481.

15. Correctly use the PriorityQueue class.

16. Be aware that a Set is a Collection with no duplicates in it.

17. Be familiar with the use of and properties of Maps:

·         NOT a Collection

·         a mapping from a set of keys to a set of values, such as account numbers mapped to customers.

·         a key is mapped to a single value but a value can have many keys mapped to it.

·         has NO iterator method

9.      Be familiar with the tables on pages 490 to 491.

Homefun: Read Chapter 19; Exercises 1, 3,  7, 8, 9, 13, 18

Programming Assignments: Exercises 2, 11, 12

Test: Chap 19

Chapter 20: Lists and Iterators

(IV Standard Data Structures, V Standard Algoritms)

1. Write programs using singly linked Lists.
   • traversals
   • insertions
   • deletions
   • iterators

2. Correctly traverse singly-linked Lists using a for loop.
3. Be able to program singly linked lists with a tail.
4. Be able to program doubly linked lists and circular lists.
5. Use Quicksort with a doubly-linked list.

Homefun: Read Chapter 20; Exercises 1, 2, 3, 4, 5, 6, 7

Programming Assignments: 15 Quicksort problem, Lab 20.4 Implementing a Singly-Linked List, Lab 20.5 Linked List With a Tail, Lab 20.4 Doubly Linked List and Circular List

Test: Chap 20