The University of Texas at Austin
Department of Computer Sciences
January 18, 2006
MW 11:00-12:30, WEL 2.256, #54045
(vlr"at"cs, TAY 3.152, 471-9554).
Mondays 3:00-4:00 and Wednesdays 1:30-2:30.
Office Hours during Exam Week.
Monday, May 8: 3-4 in Tay 3.152 (Prof. Vijaya Ramachandran)
Tuesday, May 9: 11-noon in Tay 3.152 (Prof. Vijaya Ramachandran)
Wednesday, May 11: 1:30-2:30 in Tay 3.152 (TA Rezaul Alam Chowdhury)
Rezaul Alam Chowdhury (shaikat"at"cs).
TA Office Hours.
Tuesdays 5:00-6:00 and Thursdays noon-1:00 in ESB 229, Desk 2.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein,
Introduction to Algorithms
McGraw-Hill, New York, NY, Second Edition, 2001.
A list of known errata and bugs can be accessed from
This course will cover the theoretical aspects of algorithm design and
analysis. We will study general techniques for algorithm design such as divide-and-conquer,
greedy and dynamic programming, as well as randomized algorithms and amortized analysis,
and we will study the correctness and efficiency of important data structures and algorithms,
with special emphasis on graph algorithms. We will also have a brief introduction to the theory
of NP-completeness, and we will study the design of approximation algorithms for NP-hard
problems. There will be no programming project in this course.
Who should take this course?