ANNOUNCEMENT: The (Take home) final exam will be on emailed out on Wednesday
December 1; it is due back on Friday December 10th.
HANDOUTS/ ASSIGNMENTS |
INSTRUCTOR: Sanjoy Baruah.
TEACHING ASSISTANT: Tian Wang (Email: wangtian [at] email . unc . edu)
TEXTS:
There is one required textbook
for this course:
Cormen,
Leiserson, Rivest, and Stein. Introduction
to Algorithms, Second Edition.
The following textbook is recommended:
Garey
and Johnson. Computers and Intractability: An introduction to the
theory of NP-Completeness.
SYLLABUS
The official
syllabus for this course is available here
PREREQUISITES:
SPECIAL NEEDS: If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor during the first week of the course.