Syllabus Guide Files Links Get Help

Welcome to Spring Quarter 2007! Homeworks 1 through 6 have been posted Program #2 has been (finally) posted. It is an enhancement to the drawing tool, and is due by the end of the quarter (don't put it off!!!!) Program #3 has been posted, and you should have it mostly completed by the next midterm. You are to implement quicksort and binary search. All powerpoint slides for the remaining chapters have now been posted. However, there will be additional material on binary search trees and hash tables posted soon. Midterm #2 will be Wednesday May 23. It will cover: recursion, searching, sorting, big-O notation, linked lists Tentative schedule : May 14-18: Complete discussion of linked lists this week Mon May 21: Stacks and Queues Tues May 22: Homework and midterm review Wed May 23: Midterm #2 Thu May 24: Begin discussion of trees Fri May 25: More trees (additional handouts)