CS447 Computer Algorithms
Fall 2000

Instructor: Christino Tamon
Lectures: MWF 10:00am SC340
Office hours: MW 08:00-10:00am, F 09:00-10:00am SC373
Contact: SC 373, tino@clarkson.edu

Text: Thomas Cormen, Charles Leiserson, Ronald Rivest. Introduction to Algorithms. The MIT Press, 1990.

Recommended texts:
Christos Papadimitriou, Kenneth Steiglitz. Combinatorial Optimization. Dover, 1998.
Vasek Chvatal. Linear Programming. W.H. Freeman, 1983.

Grading scheme:

  • Final exam: 40%
  • Midterm exam: 20%
  • Assignments and quizzes: 40%

Course Plan: In this course we will focus on the computational complexity of solving combinatorial problems. We will study techniques and tools for solving certain problems efficiently. In particular, we focus on basic divide-conquer techniques and analysis using recurrence formulas, dynamic programming, greedy methods, and amortized analysis. A special emphasis will be placed on graph-theoretic problems. Furthermore, we will discuss the theory of NP-completeness for discussing the limitations of solving certain problems efficiently.