COS 226: Data Structures and Algorithms, Spring 1998
This course material has been prepared to supplement
Algorithms in C by Robert Sedgewick.
The schedule and some other information
is specific to the spring 1998 offering of our algorithms course at
Princeton, but much of the material may be useful to others
taking and teaching similar courses.
Please do not publish solutions to problem sets, 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.
Due to a slight miscalculation, final exam grades were calculated out
of a maximum of 135, not 130 or 125. This had the effect of giving the
final exam slightly less weight than the advertised 22 per cent in the
final grade. This difference did not affect anyone's letter grade.
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) 1998,
Short history of credits: The index, course information and
other .html files were created by Ed Felten in 1993-95, adapting the
course materials written by R. Sedgewick in 1991. Lecture notes and
most assignments were rewritten in 1996-1997 and are being further updated
in 1998. Problems in exams and problem
sets are adapted from many sources, but primarily the new edition
of Algorithms in C that is in preparation.