Syllabus

Lectures: Mueller 153, MWF, 2:30-3:20.

Office hours: Perkins, CSE 548, MW, after class until about 4:30;
Sang, CSE 220, 1:30-2:30 W, 1:00-2:00 Thur.

### Communication

CSE 373 discussion board

### Homework

Homework 1: due 1/11/07 at 11pm. Background
reading: textbook sec. 3.6 (also 3.7) Electronic turnin form

Homework 2. due 1/20/07 at 11pm. Background
reading: textbook secs. 3.5, 1.5. Electronic turnin form

Homework 3. due 1/26/07 at the beginning of
class. Background reading: ch. 2, sec. 4.1-4.3

Homework 4: due 2/1/07 at 11pm. Background
reading: sec. 4.1-4.4. Electronic turnin form

Homework 5: due 2/8/07 at 11pm (electronic),
paper due at the beginning of class 2/9. Electronic
turnin form

Homework 6: due 3/1/07 at 11 pm. Electronic
turnin form

Homework 7: due 3/10/07 at 11 pm. Electronic
turnin form

### Exams

Midterm 2/12: topics, sample exams from winter 2006 (midterm
1 (solutions),
midterm 2 (solutions))

Final 3/13: topics, sample final from winter 2006: exam sample solution

### Class Materials

- Jan 3: Introduction: slides
- Jan 5: Mathematical background: slides Background
reading: textbook ch. 2
- Jan 8: Mathematical background (cont)
- Jan 10: Lists & Java best practices:
slides Sample code: BasicList.zip
- Jan 12: More on lists & Java best practices
- Jan 15: No class (MLK holiday)
- Jan 17: Trees (review): slides
- Jan 19:
Java generics, inner classes, iterators; Binary search trees (mostly review): slides
- Jan 22: AVL trees: slides
- Jan 24: AVL trees
- Jan 26:
AVL trees (wrapup), Splay trees: slides
- Jan 29: Tree iterators, splay trees
- Jan 31: Java generics (again), B trees (intro): slides
- Feb 2: B trees
- Feb 5: Tree wrapup, hashing
- Feb 7: Hashing (slides)
- Feb 9: Java equals and hashCode (no slides): Midterm review
- Feb 12:
*Midterm exam*
- Feb 14: Priority queues and heaps (slides)
- Feb 16: Heapsort and heap operations (slides)
- Feb 19: No Class (Presidents' day holiday)
- Feb 21: Graphs (slides), directed
graphs
- Feb 23: Topological sort (slides)
- Feb 26: Shortest paths (slides)
- Feb 28: Sets, union/find (slides)
- Mar 2:
Spanning trees (slides)
- Mar 5: Spanning trees (concl.); sorting
- Mar 7: Sorting
- Mar 9: Review

Final exam: Tuesday, Mar. 13, 2:30 pm.