Directory
Course Information |
Assignments |
Lectures |
Announcements
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: COS Bldg 105
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:
Nir Ailon - 316 CS Building - 258-5386
nailon@cs.princeton.edu
