Princeton University 
Computer Science 226

Computer Science Dept. 
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 1999 offering of our algorithms course at Princeton, but much of the material may be useful to others taking and teaching similar courses.
Time  Room  Preceptor  Office  Phone  Office Hours  
1.  M 3:30  102  Amal Ahmed  417  86324  M 4:305:30  amal@cs 
2.  M 3:30  105  Michael Goldwasser  204  81749  Tu 111  wass@cs 
3.  M 3:30  103  Jeffrey Korn  217  80451  F 12  jlk@cs 
4.  M 7:30  102  Wagner Toledo Corrêa  414  85388  W 7:308:30pm  wtcorrea@cs 
5.  M 7:30  105  Ben Gum  313  86126  tba  gum@cs 
6.  T 3:00  103  Michael Goldwasser  204  81749  Tu 111  wass@cs 
Additional TAs:  
Juan Chen  416  86304  M 1:302:30  juanchen@cs  
Xiaohu Qie  315  81795  M 4:305:30  qiexh@cs 
The course will cover algorithms from a variety of applications areas, and several mathematical topics will be discussed. The course is intended to be selfcontained with respect to such topics, but students are likely to find any mathematical experience helpful.
Attendance at lectures is expected. Copies of lecture notes (transparancies used in lecture) are in the course packet and are available online. Students are fully responsible for all material presented in lectures, even if some of it does not appear in these notes.
There will also be ten weekly problem sets. These will be handed out on Wednesdays and due at precept the following week. These will consist of short questions on the material in the lectures, notes, and programs.
There will be a midterm exam on the Wednesday before break, which will cover all material up to and including the lecture on the previous Wednesday. The final exam will cover all material in the course.
The programming assignments, problem sets, and exams all contribute significantly to your grade. Specifically, your final course grade will be calculated as follows:
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 their course.
Copyright (c) 1999, Robert Sedgewick
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 199395, adapting the course materials written by Sedgewick in 1991. The lecture notes and most assignments were rewritten by Sedgewick in 19961997 and are being further updated in 19981999. Problems in exams and problem sets are adapted from many sources, but primarily the new (third) edition of Algorithms in C.