Directory
Course Information |
Assignments |
Exercises |
Lectures |
Errata
Announcements
- 1/6 -
The last problem set (max flow, min cut) is due by January 13. You may
submit it to Lisa by dropping it off at her office or mailbox.
Course Summary
The study of fundamental data structures such as lists, queues, stacks, trees,
heaps, hash tables, and their variations. The implementation and analysis of
important algorithms for sorting, searching, string processing, geometric
applications, graph manipulation, and matrix operations. Introduction to
advanced algorithms and techniques. Prerequisite: COS 126.
Administrative Information
Lectures: TTh 11:00-11:50, Room: TBA
Professor: Bernard Chazelle -
404 CS Building - 258-5380
chazelle@cs.princeton.edu
Undergraduate Coordinator:
Tina McCoy -
410 CS Building - 258-1746
tmmccoy@cs.princeton.edu
Teaching Assistant:
Lisa Worthington - 206 CS Building - 258-2211
lworthin@cs.princeton.edu
