Computer Science 226
Data Structures and Algorithms
Course Information |
COS 226 HOME PAGE
This course material has been prepared to supplement
Algorithms in C, Parts 1-5
by Robert Sedgewick.
The schedule and some other information
are specific to the Spring 2002 offering of our data structures course at
Princeton, but much of the material may be useful to others taking
and teaching similar courses.
This is where we will post any announcements or
Please do not publish solutions to programming assignments,
exercises, and exams
in a way that could compromise their utility as pedagogical tools. At
Princeton, this is a violation of the basic rights, rules and
responsibilities of members of the university community.
All rights reserved. None of this material may
be reproduced, stored in a retrieval system, or transmitted,
in any form or by any means, electronic, mechanical, photocopying,
recording or otherwise without prior written permission.
Permission is granted to instructors who adopt
Algorithms in C to use this supplemental material in conjunction with
Copyright (c) 2002,
Short history of credits:
These course materials
have been under development by R. Sedgewick since at least 1978.
The index, course information and
other .html files on this website
were created by Ed Felten in 1993-95, adapting the
course materials written by Sedgewick in 1991. The lecture notes and
most assignments were rewritten by Sedgewick
in 1996-1997. Some material was added by Michael Goldwasser in 1999.
Further updates are being made in 2002. Problems in exams and problem
sets are adapted from many sources, but primarily the new (third) edition
of Algorithms in C.
cos226 Class Page
Last modified: January 27, 2002