| 1 |
Tue Jan 13 |
Course Introduction Configuring Eclipse Sequence Palindromes |
|
 |
| 2 |
Wed Jan 14 |
Reading Formal Contract Specifications |
  |
|
| 3 |
Thu Jan 15 |
Implement and Test static method smooth |
 |
 |
| 4 |
Fri Jan 16 |
Abstract Classes |
 |
|
| 5 |
Tue Jan 20 |
JUnit Testing Revisited |
 |
 |
| 6 |
Wed Jan 21 |
Kernel Implementations I Queue1L |
 |
|
| 7 |
Thu Jan 22 |
Introduction to Version Control and Subversion Queue on Sequence |
 |
 |
| 8 |
Fri Jan 23 |
Kernel Implementations II NaturalNumber2 |
 |
|
| 9 |
Tue Jan 27 |
Sequence on Stack |
 |
 |
| 10 |
Wed Jan 28 |
Kernel Implementations III Two-Level Thinking Commutative Diagrams |
|
|
| 11 |
Thu Jan 29 |
Set on Queue |
 |
 |
| 12 |
Fri Jan 30 |
Kernel Implementations IV Representation Invariant (convention) Abstraction Function (correspondence) |
|
|
| 13 |
Tue Feb 3 |
Map on Queue |
 |
 |
| 14 |
Wed Feb 4 |
Hashing Set with hashing |
 |
|
| 15 |
Thu Feb 5 |
Hashing Experiments |
 |
 |
| 16 |
Fri Feb 6 |
Mathematical BinaryTree Notation BinaryTree: Formal Contract Specification |
 |
|
| 17 |
Tue Feb 10 |
Recursion on BinaryTree: static methods height, isInTree |
 |
 |
| 18 |
Wed Feb 11 |
Binary Search Trees |
 |
|
| 19 |
Thu Feb 12 |
Binary Search Trees: static methods isInTree, removeSmallest |
  |
 |
| 20 |
Fri Feb 13 |
SortingMachine: Formal Contract Specification Sorting Algorithms |
|
|
| 21 |
Tue Feb 17 |
Queue: secondary method sort (Insertion Sort) |
 |
 |
| 22 |
Wed Feb 18 |
Midterm Exam #1 |
|
|
| 23 |
Thu Feb 19 |
Queue: secondary method sort (QuickSort) |
 |
 |
| 24 |
Fri Feb 20 |
SortingMachine Implementations Heaps and Heapsort |
|
|
| 25 |
Tue Feb 24 |
Heapsort: static method siftDown |
 |
 |
| 26 |
Wed Feb 25 |
Linked Data Structures I: Singly-Linked Lists |
 |
|
| 27 |
Thu Feb 26 |
Stack on Singly-Linked List |
 |
 |
| 28 |
Fri Feb 27 |
Linked Data Structures II: Doubly-Linked Lists Standard Methods |
|
|
| 29 |
Tue Mar 3 |
List on Singly-Linked List with Two Smart Nodes Implementing an Iterator |
 |
 |
| 30 |
Wed Mar 4 |
Mathematical Tree Notation Tree: Formal Contract Specification BugsWorld Project Introduction |
 |
|
| 31 |
Thu Mar 5 |
BugsWorld Contest |
  |
|
| 32 |
Fri Mar 6 |
Abstract Syntax Trees Statement: Contract Specification |
 |
|
| 33 |
Tue Mar 10 |
Recursion on Statement: static method countOfPrimitiveCalls |
 |
 |
| 34 |
Wed Mar 11 |
Program: Contract Specification Using Statement and Program |
 |
|
| 35 |
Thu Mar 12 |
Program: secondary method prettyPrint |
 |
 |
| 36 |
Fri Mar 13 |
Program and Statement Practice: static methods renameInstruction |
|
|
| Tue Mar 17 |
No classes |
| |
| Wed Mar 18 |
No classes |
| |
| Thu Mar 19 |
No classes |
| |
| Fri Mar 20 |
No classes |
| |
| 37 |
Tue Mar 24 |
Recursion on Statement: secondary method prettyPrint |
 |
 |
| 38 |
Wed Mar 25 |
Context-Free Grammars |
 |
|
| 39 |
Thu Mar 26 |
Tokenizer |
 |
 |
| 40 |
Fri Mar 27 |
Recursive Descent Parsing |
  |
|
| 41 |
Tue Mar 31 |
Recursive Descent Parser Evaluation of Arithmetic Expressions |
 |
 |
| 42 |
Wed Apr 1 |
Code Generation |
 |
|
| 43 |
Thu Apr 2 |
BugsWorld Virtual Machine Interpreter |
 |
 |
| 44 |
Fri Apr 3 |
Midterm Exam #2 |
|
|
| 45 |
Tue Apr 7 |
Program: secondary method generatedCode |
 |
 |
| 46 |
Wed Apr 8 |
Java Interfaces Kernel Design, Interface Types, Javadoc Tags, Packages |
|
|
| 47 |
Thu Apr 9 |
WaitingLine Family Interface Design |
 |
 |
| 48 |
Fri Apr 10 |
Common Methods: equals, hashCode, toString instanceof, Type Erasure |
 |
|
| 49 |
Tue Apr 14 |
WaitingLine Family Class Implementation |
 |
 |
| 50 |
Wed Apr 15 |
Java Collections Framework |
  |
|
| 51 |
Thu Apr 16 |
Practice with Java Collections Framework |
 |
 |
| 52 |
Fri Apr 17 |
Java Collections Framework (continued) Java Input/Output IOException; try-catch |
 |
|
| 53 |
Tue Apr 21 |
Practice with File I/O and Exceptions |
 |
 |
| 54 |
Wed Apr 22 |
Java Loose Ends: Exceptions; Static vs. Instance Members; Nested Classes; Access Modifiers; Final |
|
|
| 55 |
Thu Apr 23 |
Practice with Static Data Members |
 |
 |
| 56 |
Fri Apr 24 |
Review |
 |
|