COS 226, Spring 1996. Lectures

Department of Computer Science, Princeton University

COS 226: Data Structures and Algorithms, Spring 1996

R. Sedgewick

SCHEDULE OF LECTURES

Follow links to get to .ps files for transparaencies used in lecture (try magstep=-1 in Ghostview).

Date	Chapter(s)	Lecture Topic(s)
February 5	1-7	Introduction
7	8	Elementary sorts, Shellsort
12	9	Quicksort
14	12	Mergesort, Analysis
19	11	Priority queues
21	10	Radix sorting
21	14	Searching ADTs
28	15	Balanced trees
March 4	16	Hashing
6	17, 18	Radix trees and tries
11	19	String searching
13		midterm exam
25	20, 21	Pattern matching
27	22	File compression
April 1	24, 25	Basic geometric algorithms
3	26, 27, 28	Geometric search
8	29, 30, 32	Basic graph algorithms
10	31	Spanning trees
15	32	Paths in graphs
17	33, 34, 43	Network flow, matching, linear programming
22	36, 41	Multiplication
24	23	Cryptology
29	42	Dynamic programming
May 1	45	NP-completeness
13		review for final exam

Problem Sets

Problem sets are handed out in lecture each Wednesday, due the following Wednesday, except March 12. These are a very important part of the course and should be taken seriously. Not only do they contribute a substantial percentage to your grade, but also you can be sure that many of the questions will reappear on the midterm and final, but with different input data.

Programming Assignments

Programs are handed out in lecture on Wednesday and due for electronic submission eight days later (Thursday), with hardcopy submission at lecture the following Monday. These programs may be developed on the computer of your choice. It is your responsibility to describe how you have completed the assignment in the written submission that you hand in on Monday, not ours to glean this information from code that you submit electronically on Thursday.

Precepts

At precepts, we return and discuss the program 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.