[an error occurred while processing this directive]
Course Lectures:
Week 01
Lecture 01 (01/14):
The Best Little Pizza House in Texas
Lecture 02 (01/16):
OO Pizza Design
Lecture 03 (01/18):
Java Syntax
;
Pizza Code
Week 02 (MLK Holiday 01/21: no lecture/lab Monday, Monday make-up labs Tue 1-2:30 pm, 4-5:30 pm)
Lecture 04 (01/23):
Immutable List Structure
;
List code
Lecture 05 (01/25):
code
;
documentation
Week 03
Lecture 06 (01/28):
Singleton and Composite Patterns
;
Sample Code
Lecture 07 (01/30):
Using helpers
Lecture 08 (02/01):
To Cook or Not To Cook; Decoupling Algorithms from Data Structures - The Visitor Pattern
Week 04
Lecture 09 (02/04):
Another look at list visitors;
Code examples
Lecture 10 (02/06):
Information Hiding Principles and the Abstract Factory Pattern
Lecture 11 (02/08): Abstract List Factory
Week 05
Lecture 12 (02/11):
State Design Pattern and Application to Mutable Linear Recursive Structure
;
LRStruct Code
;
LRStruct Docs
Lecture 13 (02/13):
More on LRStruct and its visitors
;
Exam 1 tonight
: get a siesta this afternoon!
Lecture 14 (02/15):
Of NOOT and OOT - Introduction to Inner Classes.
Week 06
Lecture 15 (02/18):
Hangman's Word
; Discussion of Hangman Project.
Lecture 16 (02/20):
Simple GUI Applications
(
Code
)
Lecture 17 (02/22): Simple Hangman;
Code
Week 07
Lecture 18 (02/25):
"Pointers Manipulations" on LRStruct
Lecture 19 (02/27):
Restricted Access Containers
(
code
,
code
)
Lecture 20 (03/01): Extending Restricted Access Containers (
code
), Java's java.lang.Comparable
Week 08 (Spring Break: 03/04-03/08: no lectures and no labs)
Week 09
Lecture 21 (03/11): Discussion of Koch curves project and lab
Lecture 22 (03/13): The Dictionary (
code
)
Lecture 23 (03/15):
Binary Tree
Week 10
Lecture 24 (03/18):
Discussion of Koch curves MVC
;
Dynamic class loading
Lecture 25 (03/20):
Binary Search Trees.
Lecture 26 (03/22): An IDictionary using the BST visitors (
code
); in-order, pre-order, and post-order tree traversal.
Week 11 (No lecture on 03/29/02: Spring Recess!)
Lecture 27 (03/25): ``
Big-Oh
''
Lecture 28 (03/27):
An Array-based Implementation of IDictionary
Week 12
Lecture 29 (04/01):
Hash Tables and Hash Functions
Lecture 30 (04/03):
Hash Functions
;
Exam 2 tonight!
Lecture 31 (04/05): Games 4 Two;
Tic-Tac-Toe Code
;
Power Point Presentation
Week 13
Lecture 32 (04/08): Discussion of Lab 12; Games 4 Two (cont.)
Lecture 33 (04/10):
Min-Max Principle and Alpha-Beta Pruning
Lecture 34 (04/12): Discussion of Project #4;
Design Patterns for Sorting
;
Published paper on Design Pattern for Games
Week 14
Lecture 35 (04/15): Return Exam 2;
Sort Big Oh analysis
;
Code
; Decorating a Sort Algorithm.
Lecture 36 (04/17):
Heaps and Heap sort
Lecture 37 (04/19): A heap-based RAC
Code
;
A Hybrid BST and Heap
Week 15
Lecture 38 (04/22):
Design Patterns for Self-balancing Trees
Lecture 39 (04/24): SBT Deletion Algorithm
Lecture 40 (04/26): Wrap-up; Course Evaluation