| Week | Date | Activities |
| 11 | Thu 3/17 | COVERED: Final exam, in class (in normal lecture room) |
| 10 | Thu 3/10 | COVERED: priority queues and heaps; review for final exam |
| 10 | Tue 3/8 | COVERED: priority queues and heaps |
| 9 | Thu 3/3 | COVERED: hashing; implementing a hash set ASSIGNED: Homework 6; due Fri 3/11, 11:59pm |
| 9 | Tue 3/1 | COVERED: Sets and Maps; intro to hashing |
| 8 | Thu 2/24 | COVERED: More AVL trees (S. Moore lectures) |
| 8 | Tue 2/22 | COVERED: AVL trees |
| 7 | Thu 2/17 | COVERED: Binary search trees ASSIGNED: Homework 5; due Mon 2/28, 11:59pm |
| 7 | Tue 2/15 | COVERED: Searching and binary trees |
| 6 | Thu 2/10 | COVERED: Go over midterm; sorting ASSIGNED: Homework 4; due Thu 2/17, in class |
| 6 | Tue 2/8 | COVERED: Midterm, in class |
| 5 | Thu 2/3 | COVERED: Midterm Review; Sorting |
| 5 | Tue 2/1 | COVERED: Recursion, Sorting |
| 4 | Thu 1/27 | COVERED: Stacks and queues ASSIGNED: Homework 3; due Fri 2/4, 11:59pm |
| 4 | Tue 1/25 | COVERED: Queues |
| 3 | Thu 1/20 | COVERED: Linked lists ASSIGNED: Homework 2; due Wed 1/26, 11:59pm |
| 3 | Tue 1/18 | COVERED: Linked lists |
| 2 | Thu 1/13 | COVERED: Algorithm Analysis ASSIGNED: Homework 1; due Thu 1/20, 4:15pm, in class |
| 2 | Tue 1/11 | COVERED: Algorithm analysis |
| 1 | Thu 1/06 | COVERED: Algorithm analysis |
| 1 | Tue 1/04 | COVERED: Syllabus, Review ASSIGNED: Homework 0; due Wed 1/12 11:59pm |
| Instructor: | Marty Stepp ( |
| office: | Cherry Parkes 225 |
| office hours: | MW 12:30 - 1:30pm; TTh 6:35 - 7:30pm; and whenever door is open, or by appointment |
| office phone: | (253) 692-4540 |
| TA: | Roman Porter (romanp AT u washington) |
| office: | Pinkerton 306b |
| office hours: | M 4:00 - 4:45pm; Th 3:15 - 4:00pm; or by appointment |