CSCI 220 Spring 1998 Syllabus

CSCI 220 Spring 1998: Syllabus

The textbook is:

Kingston, Jeffrey H. Algorithms and Data Structures: Design, Correctness, Analysis (second edition). Harlow, England: Addison-Wesley, 1998 (ISBN 0-201-40374-9).

References are to the text unless otherwise noted. (The text is sometimes referred to as [K] in course materials.) Please note that the syllabus is tentative: entries in italics indicate modifications to the original syllabus.

The final exam for the course will take place on Thursday, December 10, 1998, at 2pm in the classroom (Sumwalt 213). This is the regularly scheduled time for courses taught from 12:30 to 1:45pm on Tuesdays and Thursdays.

A course outline follows. The Sections of the text listed under the ``lecture'' headings should be read before the corresponding class.

Week Begins	Topic	Lecture #1	Lecture #2	Homework
August 17	Introduction	None	Introduction	None
August 24	Algorithm Correctness	Ch. 1	Ch. 1	1.1, 1.2
August 31	Complexity Analysis	Ch. 2	Ch. 2	TBA
September 7	Data Abstraction	Ch. 3	Ch. 3	TBA
September 14	Algorithm Design	Ch. 4	Ch. 4	TBA
September 21	Algorithm Design (Ctd.) and Test	Ch.4	Test	TBA
September 28	Lists, Stacks, and Queues; Trees	Ch. 5	Ch. 6	TBA
October 5	Trees (Ctd.)	Ch. 6	Ch. 6	TBA
October 12	Spring Break and Symbol Tables	No Class	Ch. 7	TBA
October 19	Symbol Tables (Ctd.)	Ch. 7	Ch. 7	TBA
October 26	Priority Queues	Ch. 8	Ch. 8	TBA
November 1	Election Day and Priority Queues (Ctd.)	No Class	Ch. 8	TBA
November 9	Graphs	Ch. 11	Ch. 11	TBA
November 16	Graphs (Ctd.)	Ch. 11	Section 12.1	TBA
November 23	Graphs (Ctd.) and Thanksgiving	Section 12.2	No Class	TBA
November 30	Sorting	Ch. 9	Ch. 9	TBA