| Date | Topic | PPT |
|---|---|---|
| Jan 9 |
Rules, etc. Processing vs. Java a romp through chapters 1 & 2 |
1 2 |
| Jan 11 |
Recursion from Chapter 3 NetBeans debugging with tower of Hanoi |
3 |
| Jan 18 | Abstract data types from Chapter 4 | 4 |
| Jan 20 | ||
| Jan 23 | Java coding standards | |
| Jan 25 | ||
| Jan 30 |
Linked lists from Chapter 5IntList in JavaJava Collections Framework |
5A 5B |
| Feb 1 | ||
| Feb 6 |
More recursion from Chapter 6 in class example |
6 |
| Feb 8 | ||
| Feb 13 | Invoking methods & Fixing bugs | |
| Feb 15 | Instructor on Jury Duty -- Class postponed until Feb 17. | |
| Feb 17 | Invoking methods & Fixing bugs | |
| Feb 20 | Stacks from Chapter 7 & Java’s Deque |
7A 7B |
| Feb 22 | Midterm 1 | |
| Feb 27 | Implementing Stacks and Queues in NetBeans
and Google docs
using
the Java
Collections Framework Deque |
7A 7B 8A 8B 9A 9B |
| Feb 29 | ||
| Mar 12 |
Expression evaluation with stacks (Chapter 7) Terms of inheritance (Chapter 9) |
|
| Mar 14 | ||
| Mar 19 | Work on Homework 9 | |
| Mar 21 | ||
| Mar 26 | f(n) = O(g(n)) if ∃ k: ∃ n0: ∀ n: n ≥ n0 ⇒ |f(n)| ≤ k|g(n)| sorting & Sorting demos & Sorting Out Sorting & Questions |
10A 10B |
| Mar 28 | ||
| Apr 2 | Hashing |
12A 12B |
| Apr 4 | Guided homework with hash table | |
| Apr 9 | Tree traversal using Web-based Automatic Grading System | 11A |
| Apr 11 | Midterm 2 | |
| Apr 16 | Binary Search Trees using Web-based Automatic Grading System | 11A |
| Apr 18 | Undergraduate Research Symposium Day | |
| Apr 23 | Binary Search Trees using Web-based Automatic Grading System | 11A |
| Apr 25 | Final exam from 8:00 am to 10:30 am | |