| Week | Monday | Wednesday | Fridays |
| Week 1 | 01/03/2005
Introduction Big-O notation Concept of an Abstract Data Type (ADT) Reading: Dale, 2.1, plus pp. 159-164 Notes: Introduction Homework: Homework 1 (due via Blackboard Jan 10, 1:20pm) |
01/05/2005
List ADT, array implementation Reading: Dale, 3.1, 3.2 Notes: Abstract Data Types |
01/07/2005
List ADT, array implementation (continued) Reading: Dale, 3.1, 3.2 ROOM CHANGE: All Friday meetings
this quarter will be held in North Science 104
|
| Week 2 | 01/10/2005
Searching lists -- linear and binary search Reading: Dale, pp. 137-139, 150-156 |
01/12/2005
Sorted lists, array implementation Reading: Dale, 3.3-3.5 |
01/14/2005
Stacks Reading: Dale, 4.1 |
| Week 3 | 01/17/2005
Martin Luther King Day |
01/19/2005
Templates, stack example Reading: Dale, 4.2 |
01/21/2005
Queues Reading: Dale, 4.5 |
| Week 4 | 01/24/2005
Linked implementation of Stack, Queue ADT's Reading: Dale, 5.1, 5.2 |
01/26/2005
Linked implementation of List ADT (Unsorted and Sorted) Reading: Dale, 5.3, 5.4 |
01/28/2005
Polymorphism Reading: Dale, 6.6 |
| Week 5 | 01/31/2005
Review for exam 1 |
02/02/2005
Exam 1 |
02/04/2005
Recursion review Reading: Dale, 7.1-7.6 |
| Week 6 | 02/07/2005
Recursion and lists Reading: Dale, 7.7-7.9, 7.11 |
02/09/2005
Trees Reading: Dale, 8.1-8.4 |
02/11/2005
Trees: recursive implementation Reading: Dale, 8.5 |
| Week 7 | 02/14/2005
Tree traversals Reading: Dale, 8.5 (continued) |
02/16/2005
Priority queues Reading: Dale, 9.1 |
02/18/2005
Heaps Reading: Dale, 9.2 |
| Week 8 | 02/21/2005
Review for exam 2 |
02/23/2005
Exam 2 |
02/25/2005
Graphs Reading: Dale, 9.3 |
| Week 9 | 02/28/2005
Graphs (continued) Reading: Dale, 9.3 |
03/02/2005
Sorting lists -- simple sorting algorithms Reading: Dale, 10.1 |
03/04/2005
Quicksort Reading: Dale, 10.1, pp. 438-446 |
| Week 10 | 03/07/2005
Mergesort Reading: Dale, 10.1 |
03/09/2005
Hashing Reading: Dale, 10.3 |
03/11/2005
Review for final |
| Week 11 | 03/14/2005 | 03/16/2005
Final exam, 2 PM-3:50 PM |
03/18/2005 |