Prerequisites

An elementary course in analysis of algorithms, such as CS 3130 or consent of instructor

Textbook

Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms . McGraw Hill.

Objectives

• Introduction and review
• Divide and Conquer
• Greedy Methods
• Dynamic Programming
• Traversal and Search Techniques
• Backtracking
• Branch and Bound
• NP-Completeness
• Approximation Algorithms

/etc/policy

I'll expect you to be present in most of the classes. I will not be taking attendance but if you start missing too many classes, please take responsibility for your absence, specially when it concerns tests and homeworks. When you come to class, you must change your cell phones to silent mode. In the tests, the cell phones must be completely switched off. If you are more than ten minutes late, please try not to disrupt the class. I'll penalize you by one letter grade for habitually coming late to class (more than five times I notice you coming late).

The grade will be based on programming and homework assignments and two tests. Each assignment must be meticulously documented and clearly identify its purpose, author, and date. You are free to do the projects in C, C++, or Java, but the programs must execute on admiral. Tests are non-comprehensive but may have some overlap of material from one test to the next. All tests will be open book and open notes but no electronic devices will be permitted. If you miss any test or assignment without making prior arrangement, you will have a zero. I will not give any make up test. The distribution of grades will be as follows:

Programming Assignments	60%
Two tests	20% each

Anyone desiring an EXC grade after October 31, 2013 must be passing the course at that point to get EXC.

/etc/exam_dates

Test 1	October 10, 2013
Test 2	December 05, 2013

There is no final exam.