Instructor Christino Tamon
Lectures SC301 TR 08:00
Office Hours TBA
Contact SC 373, firstname.lastname@example.org
Jon Kleinberg and Eva Tardos, Algorithm Design (Addison-Wesley, 2005).
Michael Mitzenmacher and Eli Upfal, Probability and Computing, (Cambridge University Press, 2005).
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, 2nd edition (Cambridge, Massachusetts: The MIT Press, 2001).
This course studies advanced algorithmic techniques for solving computational problems efficiently. Some emphasis will be given on graph-theoretic problems and data structures that are relevant to them. The theory of NP-completeness on the limitations of solving problems efficiently will also be discussed.
OBJECTIVE & OUTCOMES
The objective of this course is to learn fundamental algorithmic techniques, to gain the ability to evaluate the efficiency of algorithms, and to understand certain intractability issues concerning hard algorithmic questions.
The specific outcomes are basic knowledge of the following:
REQUIREMENTS & POLICIES
Although attendance is not mandatory, students are responsible for all course materials covered in lectures and any quizzes given during class periods. Students that need to make up missing course work must provide the required Clarkson official exempt form. All students must submit their own work; the exchange of ideas are encouraged but ultimately the submitted work must be the student's own. Please refer to the Clarkson University Regulations for more guidelines on academic integrity and related matters.
GRADING SCHEME (TENTATIVE)
Tests (2): 60%
Final Project: 10%
SCHEDULE OF TOPICS (TBA)