Princeton University Computer Science Department

Computer Science 423 Theory of Algorithms Robert Tarjan

Spring 2004

Course Summary

This course is designed to provide students with an understanding of the principles and techniques used in the design and analysis of computer algorithms. The course is primarily theoretical and does not require programming, but it does require understanding of the notion of a mathematical proof, some knowledge of elementary discrete mathematics, and mathematical problem-solving skills. We shall discuss and analyze a variety of data structures and algorithms chosen for their importance and their illustration of fundamental concepts. We shall emphasize analyzing the worst-case running time of an algorithm as a function of input size. We shall also spend some time exploring the boundary between feasible (polynominal-time) computations and infeasible computations. This will include discussion of the notorious P=NP? question.

Administrative Information

Lectures: MW 11:00-12:20, Room: 104 Large Auditorium

Professor: Robert Tarjan - 324 CS Building - Phone: 258-4797 - Email: ret@cs.princeton.edu

Secretary:Mitra Kelly - 323 CS Building - Phone: 258-4562 - Email: mkelly@cs.princeton.edu

Undergraduate Coordinator: Tina McCoy - 410 CS Building - Phone: 258-1746 - Email: tmmccoy@cs.princeton.edu

Teaching Assistants:

Shengyu Zhang (Office Hours: Tuesdays 3-4pm), 103C CS, Ext 8-0419, szhang@cs.princeton.edu