CIS 9615. Design and Analysis of Algorithms

Section 001. Spring 2010



Dr. Pei Wang
OFFICE: Room 1050, Wachman Hall (Computer Activity Building)
ADDRESS: CIS Department, Temple University, Philadelphia, PA 19122
PHONE: (215)204-9255


Lectures: Tuesday 5:30 PM - 8:00 PM, Tuttleman Learning Center 403B
Office Hours: Tuesday/Thursday 12:30-2:00 PM, and by appointment


CIS 8511 and CIS 8513.

Course Description

General techniques for developing algorithms. Divide and conquer Greedy dynamic programming. Search and traverse. Backtracking. Branch and Bound. Some theoretical results will be discussed, for example, those relating to NP-completeness.

Reading Materials

Textbook: Introduction to Algorithms, Second Edition, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein

Additional: On-line materials linked from the course webpage and lecture notes.


See course website at


Attendance to all lectures and examinations is required.


All of the above must be the student's own work. Plagiarism and academic cheating will be punished.

Disability Disclosure Statement

Any student who has a need for accommodation based on the impact of a disability should contact me privately to discuss the specific situation as soon as possible. Contact Disability Resources and Services at 215-204-1280 in 100 Ritter Annex to coordinate reasonable accommodations for students with documented disabilities.