| Class number | Date | Reading due
S&W = Stanat & Weiss B = Bailey |
Homework due
at the beginning of class |
Class content |
| 1 | Aug. 22 | Red tape; why Java | ||
| 2 | Aug. 24 | B: Appendix A, Preface, Chapter 0 | Write 3 abstractions | Java review 1 |
| 3 | Aug. 29 | B: Chapter 1 | Java review 2: I/O, if, loops | |
| 4 | Aug. 31 | Program 0 (optional) | Java review 3: loops, methods | |
| 5 | Sept. 5 | Java review 4: OOP | ||
| 6 | Sept. 7 | S&W: Chap. 2; B: Chap. 2 | Java review 5 | |
| 7 | Sept. 12 | |||
| 8 | Sept. 14 | Program 1 | Assertions (S&W, Ch 2) | |
| 9 | Sept. 19 | S&W Chap 3 | Quantifiers (S&W, Ch 2) | |
| 10 | Sept. 21 | Assignment 1 | Rules of inference (S&W, Ch 3) | |
| 11 | Sept. 26 | B: Chap 3 read but don't study | Loop invariants | |
| 12 | Sept. 28 | S&W: Chap 4 and 5 | Assertion class & exceptions. | |
| 13 | Oct. 3 (break follows) | B Chap 4; S&W Chap 6 | Assignment 2 | Assertions and exceptions |
| 14 | Oct. 10 | S&W 7, 8, and 9 | Recursion 1 | |
| Oct. 12 | S&W 10 | No class: University Day | ||
| 15 | Oct. 17 | B Chap 5; S&W Chap 11 | Program 2 (assertions) | Inheritance |
| 16 | Oct. 19 | EXAM 1 (see below) | ||
| 17 | Oct. 24 | Algorithm analysis | ||
| 18 | Oct. 29 | Alg analysis; sorting | ||
| 19 | Oct. 31 | Q(n2) | ||
| 20 | Nov. 2 | B Chap 6, 7; S&W Chap 12 | Assignment 3 | Q(n log n) sorting |
| 21 | Nov. 7 | Q(n log n) and Q(n) sorting | ||
| 22 | Nov. 9 | B Chap 3, 7; S&W Chap 14 | Program 3 (recursion) | Linked structures |
| 23 | Nov. 14 | Linked structures; Vectors | ||
| 24 | Nov. 16 | |||
| 25 | Nov. 21 (break follow) | B Chap 9 (read, don't study) | Backtracking | |
| 26 | Nov. 28 | EXAM 2 | ||
| 27 | Nov. 30 | B Chap 10, 12 | Program 4 (linked lists) | Backtracking: pruning. Trees |
| 28 | Dec 5 | More trees. Finite state mach. | ||
| 29 | Dec 7 | Review and exam preview | ||
| Dec 8 | Program 5 (backtracking) | |||
| Final exam | Dec 16 | Final exam noon-3:00 |
Homework Please
turn written homework in on 8 1/2x
11 paper, unfolded, and stapled in the upper
left corner. If you turn in larger paper, I reserve the right to
trim it to 8 1/2x
11 and grade
what's left.
Exams
Content: Each exam will cover everything covered in the course
so far.
Format: Closed book, notes, computers, etc. You will write
on the exam itself.
All you need to bring is something to write with. Exams will
take the full 75 minutes.
Final exam
Content:
the entire course.
Format: closed books, notes, etc. You will write directly
on the exam
paper, so you need bring only something to write with. The exam will
be designed
for about 150 minutes, but you will have the full 180 minutes.