Computer Science 226
Algorithms and Data Structures
Fall 2005

Course Information | Assignments | Exercises | Lectures


Description:   This course surveys the most important algorithms and data structures in use on computers today. Particular emphasis is given to algorithms for sorting, searching, and string processing. Fundamental algorithms in a number of other areas are covered as well, including geometric and graph algorithms. The course will concentrate on developing implementations, understanding their performance characteristics, and estimating their potential effectiveness in applications.

Instructor:   Kevin Wayne, CS 207, 258-4455, wayne@cs. Office hours: M 4-5pm, Th 2-3pm, F 3-4pm.

Lectures:   TTh 11-12:20, Bowen Hall 222. Attendance at lectures is expected.

Precepts:   Precepts meet on Tuesdays for 50 minutes. At precepts, we will return and discuss the exercises and programming assignment from the previous week. We will also give details and answer questions about the new assignment. You should come prepared to participate in the discussion, not just ask questions. The first precept is 9/20. Here is a list of students sorted by precept and by name.

 1  T 12:30 Friend 110 Keith Morley CS 214 M 3-4pm, Th 1-2pm rmorley@cs
 3  T 3:30 Friend 111 Harlan Yu CS 317 W 8-9pm, F 1-2pm harlanyu@cs

Web Site:   The COS 226 course website is We will post announcements and administrative information on this site and use it to control assignment submission and other administrative tasks. You will find course content such as lecture notes, programming assignments, and exercises here at
You may wish to bookmark this link for direct access to course materials that will persist after the end of the course.

Textbooks:   The course textbooks are:

You are expected to read the books, particularly the parts that cover the same ground as lectures and programming assignments. They contain a wealth of information beyond what we can cover in lecture that are certain to enhance your understanding of the course material. A safe strategy is to skim through the book before lecture to get a general idea of what is to be covered, then study it carefully afterwards. While you are not responsible for reading about topics that we do not cover in lecture or that are beyond the scope of the course, you are responsible for exercising good judgement about choosing what to read.

Prerequisites:   COS 126 or COS 217 or permission of instructor.

Grades:   Your grade for the course will be based on the following components: programming assignments: (45%), exercises: (15%), midterm exam: (15%), final exam: (25%), and staff discretion.

Programming assignments:   There will be regular programming assignments.

Exercises:   There will also be weekly exercises. These will consist of short questions on the material in the lectures and readings. Some of these questions will reappear on the exams, but with different input data. Exercises are due at the beginning of lecture on Thursdays and will be returned in precepts. In calculating your course grade, we will drop your lowest three exercise scores.

Exams:   There will be an in-class midterm exam on the Thursday before break. The final exam is comprehensive, although it will stress material covered since the midterm. You can also study from old exams. Unless prior arrangements are made, a grade of zero will be recorded for missed exams. Exams are closed book, and no calculators or other computational devices are permitted. You may bring a 8.5-by-11 sheet with handwritten notes to the exam.

Computers:   You may develop your programs on any machine that you like: we encourage you to use your own equipment. We provide instructions for for setting up a Java programming environment under Windows, OS X, and Linux.

Lab TA coverage:   The Princeton COS department hires undergraduate lab assistants who are available to answer general computing questions in the Friend 016 and 017 labs. Here is the lab TA schedule. Lab TAs can assist you in debugging, provided you have first made a reasonable effort to identify the bug and isolate the problem. If you have questions regarding the course material or programming assignments, see your preceptor or instructor.

Important note:   Please do not publish solutions to programming assignments or exercises 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.

Copyright:   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 Java to use this supplemental material in conjunction with their course.

Short history of credits:   These course materials have been under development by Robert 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 by Bob Sedgewick and Kevin Wayne in 2003 and 2004. Problems in exams and problem sets are adapted from many sources, but primarily the new (third) edition of Algorithms in Java.