### CS447/CS647/EE667 Computer Algorithms (Fall 2001)

#### Course Prerequisites: CS344 Algorithms and Data Structures
and (MA211 Foundations or MA346 Applied Algebra and Discrete Mathematics)

### Course Contact Information

**Instructor**: Christino Tamon

**Lectures**: Monday Wednesday Friday 9am Science Center 346

**Office hours**: Monday Wednesday 10-11am & 3-4pm and Friday 10-11am Science Center 373

**Contact**: Science Center 373, tino@clarkson.edu

The main text is
**Introduction to Algorithms** (second Edition)
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, MIT Press, 2001.

A recommended supplement is
**Introduction to Graph Theory** (second edition)
by Douglas B. West, Prentice Hall, 2001.

### Topical Outline

This course studies the algorithmic techniques for solving computational problems efficiently.
In particular, the following techniques are covered: basic divide-conquer techniques and analysis
using recurrences, dynamic programming, greedy methods, and amortized analysis. Some emphasis
will be put on graph-theoretic problems and data structures that are relevant to them. Finally,
a discussion of the theory of NP-completeness on the limitations of solving problems efficiently
will end the course.

### Objectives and 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:

- Asymptotic notation for comparing cost measures.
- Tools for dealing with summations and recurrences.
- Design and analysis techniques: dynamic programming, greedy algorithms, and amortized analysis.
- Graph theory and some of its algorithmic problems.
- Rudimentary theory of NP-completeness.

### Requirements and 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

There is no final exam in this course (pending approval).
- Tests (2): 50% (tentative dates: October 19th and November 30th)
- Assignments and Quizzes: 40%
- Project: 10% (due December 7th)