Created 22 January 2010
| CSC 207 | Algorithms and Object Oriented Design | Spring 2011 |
Note: Homework is shown in the assignment column on the day it is due (not the day assigned).
| Week | Day | Date | Topic | Reading | Assignment |
|---|---|---|---|---|---|
| 1 | Mon | 1/24 | Introduction to Object-Oriented Programming | ||
| Tue | 1/25 | Introduction to Java | Weiss 1.1-1.6, pp. 3-20 | Assignment 0 | |
| Wed | 1/26 | Lab: Introduction to Java | Basic I/O, Java Packages | ||
| Fri | 1/28 | Reference types | Weiss 2.1-2.6, pp. 27-60 | ||
| 2 | Mon | 1/31 | Lab: More Java | ||
| Tue | 2/1 | Lab: Types and Control | |||
| Wed | 2/2 | Snow Day | |||
| Fri | 2/4 | Objects and Classes | Weiss 3.1-3.6 & 3.8, pp. 69-86 & 90-97 | ||
| 3 | Mon | 2/7 | Lab: Rational Numbers | ||
| Tue | 2/8 | Lab: Introducing the Java Development Environment for Emacs (JDEE) | Assignment 1 | ||
| Wed | 2/9 | Lab: Inheritance | Weiss 4.1-4.5.2, pp. 110-138 | ||
| Fri | 2/11 | Lab: Unit Testing | Unit Testing | ||
| Lab: Getting the Book Code | |||||
| 4 | Mon | 2/14 | Generics | Weiss 4.6-4.9, pp. 142-168 | |
| Tue | 2/15 | Lab: Generics and Interfaces | Assignment 2 | ||
| Wed | 2/16 | Java Quiz | |||
| Design Patterns | Chapter 1 | ||||
| Fri | 2/18 | Lab: Builder Pattern | Creational Patterns (Ch. 2) | ||
| 5 | Mon | 2/21 | Lab: Facade Pattern | Structural Patterns (Ch. 3) | |
| Tue | 2/22 | Lab: State Pattern | Behavioral Patterns (Ch. 4) | Assignment 3 | |
| Wed | 2/23 | Introduction to Analysis | Weiss 5.1-5.3, pp. 187-200 | ||
| Fri | 2/24 | Asymptotic Analysis | Weiss 5.4-5.8, pp. 201-214 | ||
| Mon | 2/28 | Lab: Algorithm Analysis | |||
| Tue | 3/1 | Collections API | Weiss 6.1-6.5, pp. 229-258 | Assignment 4 | |
| Wed | 3/2 | Sets and Maps | Weiss 6.7-6.8, pp. 261-274 | ||
| Fri | 3/4 | Lab: Stacks and Queues | Weiss 6.6, pp. 258-261 | Lab: Book Code | |
| 7 | Mon | 3/7 | Priority Queues and Collections applications | Weiss 6.9, pp. 274-279 | |
| Tue | 3/8 | Pause for Breath | Assignment 5 | ||
| Wed | 3/9 | No Class (SIGCSE Conference) | |||
| Fri | 3/11 | Exam 1 | |||
| 8 | Mon | 3/14 | Sorting | Weiss 8.1-8.5, pp. 351-364 | |
| Tue | 3/15 | Quicksort | Weiss 8.6-8.8, pp. 364-384 | ||
| Wed | 3/16 | Lab: Sorting It Out | |||
| Fri | 3/18 | Lab: Inner Classes | Weiss 15.1-15.2, pp. 574-580 | Assignment 6 | |
| Enjoy Spring Break! | |||||
| Week | Day | Date | Topic | Reading | Assignment |
| 9 | Mon | 4/4 | AbstractCollection |
Weiss 15.3-15.4, pp. 580-584 | |
| Tue | 4/5 | ArrayList implementation |
Weiss 15.5, pp. 585-590 | ||
| Wed | 4/6 | Lab: Implementing Collections | |||
| Fri | 4/8 | Stacks and Queues | Weiss 16.1, pp. 595-605 | ||
| 10 | Mon | 4/11 | Stacks and Queues | Weiss 16.2-16.5, pp. 605-615 | |
| Tue | 4/12 | Lab: Dequeue | Assignment 7 | ||
| Wed | 4/13 | Linked Lists | Weiss 17.1-17.3, pp. 619-633 | ||
| Fri | 4/15 | Linked Lists | Weiss 17.4-17.5, pp. 633-646 | ||
| 11 | Mon | 4/18 | Lab: Linked Lists | ||
| Tue | 4/19 | Pause for Breath | Assignment 8 | ||
| Wed | 4/20 | Trees | Weiss 18.1-18.2, pp. 651-664 | ||
| Fri | 4/22 | Exam 2 | |||
| 12 | Mon | 4/25 | Tree Traversal | Weiss 18.3-18.4, pp. 665-680 | |
| Tue | 4/26 | Pause for Breath | |||
| Wed | 4/27 | Lab: Binary Trees | |||
| Fri | 4/29 | Binary Search Trees | Weiss 19.1,19.3, pp. 687-697, 702-706 | ||
| 13 | Mon | 5/2 | Hash Tables | Weiss 20.1-20.3, pp. 773-784 | |
| Tue | 5/3 | Hash Tables | Weiss 20.4-20.7, pp. 784-801 | Assignment 9 | |
| Wed | 5/4 | Lab: Hash Tables | |||
| Fri | 5/6 | Priority Queue / Binary Heap | Weiss 21.1-21.3, pp. 807-822 | ||
| 14 | Mon | 5/10 | Heapsort | Weiss 21.5, pp. 823-826 | |
| Tue | 5/11 | Lab: Heap Sort | |||
| Wed | 5/12 | Pause for Breath | Assignment 10 | ||
| Fri | 5/14 | Wrap-Up / Evaluations | |||
| F | Wed | 5/18 | Final Exam (2 PM) | ||