Princeton University

Computer Science 226
Data Structures and Algorithms
Robert Sedgewick

Spring 2001
Computer Science Department
General Information | Announcements | Assignments | Collaboration Policy | Lectures | Errata

SCHEDULE OF LECTURES

The following list of the lectures has links to the .pdf files that are begin used to make the slides used in lecture. These are intended for the presentation and not for reference use; you should study the related passages in the text to find the answers to any questions that you might have about the material.

Normally, lectures will complement the reading. An effective strategy is to look over the indicated chapter before the lecture, then read it in detail soon afterwards.
Date Chapter(s) Lecture Topic(s)
February 5 1-5 1. Introduction (4-up)
76 2. Elementary sorts, shellsort (4-up)
127 3. Quicksort (4-up)
148 4. Mergesort, analysis of algorithms (4-up)
199 5. Priority queues (4-up)
2110 6. Radix sorting (4-up)
2612 7. Symbol-table ADTs (4-up)
2813 8. Balanced trees (4-up)
March 514 9. Hashing (4-up)
715 10. Trie searching (4-up)
1211, 16 11. Specialized sorting and searching algorithms
14midterm exam
26* 12. String searching (4-up)
28* 13. Pattern matching (4-up)
April 2* 14. File compression (4-up)
4* 15. Basic geometric algorithms (4-up)
9* 16. Geometric search (4-up)
1117,18 17. Basic graph algorithms (4-up)
1619 18. Digraphs and DAGs (4-up)
1820 19. MSTs (4-up)
2321 20. Shortest Paths (4-up)
2522 21. Maxflow (4-up)
3022 22. Mincost flow (4-up)
May 2* 23. Linear programming (4-up)


The course text is Algorithms, Third Edition, in C, Addison-Wesley, 1998. by Robert Sedgewick, ISBN 0-201-31452-5. Only the first volume (Parts 1-4) of the third edition is currently available. You will get instructions on obtaining a prepublication version of the second volume (Part 5) after the break.

Precepts

At precepts, we return and discuss the program and written assigment that were handed in the previous week, and give details and answer questions about the new assignment. Attendence at precepts is mandatory, and you should come prepared to participate in the discussion, not just ask questions.

cos226 Class Page
rs@cs.princeton.edu
Last modified: February 7, 2001