Comp 550-002: Algorithms and Analysis

You must attend at least one of the first two lectures to remain enrolled in this class.

MEETING TIMES AND PLACE: MW 9:05 - 10:20. SN 0014

INSTRUCTOR: Sanjoy Baruah. (Click here for instructor's office hours, which are held at FB 134)

TA: James Martin (Email:jamesml[at]cs[dot]unc[doc]edu). Office Hours Mo Tu 4:00 - 5:30 pm, in SN 331

TEXT: There is one required text for this course:

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. Introduction to Algorithms, Third Edition. MIT Press.
The UNC Undergraduate Bulletin description of this course is
COMP 550 Algorithms and Analysis (3). Formal specification and verification of programs. Techniques of algorithm analysis. Problem-solving paradigms. Survey of selected algorithms.

SYLLABUS: Here is the syllabus (latest update: Jan 13) for this offering of COMP 283.

PREREQUISITES: COMP 410, and COMP 283 or MATH 381.

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.

DISCUSSION FORUM: I encourage the use of Piazza for class discussion. The system is highly catered to getting you help fast and efficiently from classmates (and occasionally, the TAs and the instructor). I encourage you to post your questions on Piazza and participate in discussions there. (The instructor and TAs will monitor these discussions, but for the most part not participate -- the idea is to use it as a forum for students to hold active discussions and help one another.)
You will find our class page here

TOPICS COVERED: Lecture outlines and handouts are available here (you may need a UNC Computer Science login ID to access this site; you can get yours here if you do not already have one.)