CS 600 A -- Analysis of Algorithms

Mondays from 06:15 PM to 08:45PM in Kidde 380

Course Overview:

The complexity and correctness of algorithms: big oh, big omega, and big theta notations, recurrence relations and their solutions. Worst, average and amortized analysis of algorithms with examples. Basic and advanced data structures for searching, sorting, compression and graph algorithms. Students will be given programming assignments on a regular basis. Cross-listed with CpE 600.

Pre-requisites:

CS 580, CS590, and MA 502 or equivalent.

Textbooks:

Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
MIT Press
ISBN 0-262-03293-7

Instructor:

Teaching Assistant:

Class Mailing List:

Subscribe to CS600.

Grading:

Quizzes: 30% - four quizzes, 10% for each of the three best ones
Midterm: 20%
Final: 30 %
Homework Assignments: 20% - five assignments, 5% for each of the four best ones

Policies:

There will be no make-up quizzes.
A make-up midterm/final will be granted only if the instructor is notified before the exam and there is serious illness or similarly important reason for missing the exam.
For fairness to all students there will be no individual extra credit work.
Assignments are due before the lecture begins at 6:15pm. After 6:15pm, 25% will be deducted from your grade. For homeworks late more than one (two) day(s), 50% (75%) will be deducted. No credit will be given for homeworks that are more than 3 days late.
You may collaborate on homeworks with your fellow students to a limited degree. I.e., you may discuss concept clarifications with other students, but the specific details of your homeworks must be your own work.
You must specify in writing any resources (web, books etc.) other than the textbook that you used for completing the assignments.
It is cheating to collaboratively work out a detailed solution, to copy a solution from another student or some other resource without specifying it, or to give away a solution.
ALL parties involved in a case of cheating get an automatic grade of zero (0) in the assignment/exam. Repeated cases get an F in the course. Any case of cheating will be reported to the honor board or the Dean of the Graduate School.
Programming assignments must be completed in C/C++. Submissions must include makefiles. Programming assignments are graded on style, documentation, and content. Your code must compile on the CSlab machines. Programs that do not compile will receive an automatic grade of zero (0). Submissions are accepted through 'submit' on the lab machines only (see manpages for 'submit').

Syllabus:

Week	Date	Topics	Description
1	January 23, 2006	Introduction	Chapters 1-3, Appendix A-C Asymptotic Notation, Standard Notations, Common Functions, Summations
2	January 30, 2006	Asymptotic Analysis	Chapter 4 Recurrences
3	February 6, 2006	Sorting	Chapters 6, 7 Heaps, Heapsort, Priority Queues, Quicksort
4	February 13, 2006	No Class	Institute Closed because of Snowstorm
5	February 21, 2006 Monday Schedule	Sorting	Chapters 8, 9 Lower Bounds for Sorting, Counting Sort, Radix Sort, Bucket Sort
6	February 27, 2006	Probabilistic Analysis	Chapters 5, 7 Randomized Algorithms, Randomized Quicksort
7	March 6, 2006	Order Statistics and Hashing	Chapters 9, 11 Medians and Order Statistics, Minimum and Maximum, Hashing, Collision Resolution
8	March 13, 2006	No Class	Spring Break
9	March 20, 2006	MIDTERM	Comprehensive
10	March 27, 2006	Trees	Chapters 12, 13 Binary Search Trees, Red-Black Trees
11	April 3, 2006	Dynamic Programming	Chapter 15 Dynamic Programming, Matrix-Chain Multiplication
12	April 10, 2006	Greedy Algorithms, Amortized Analysis	Chapters 16, 17 Greedy Strategy, Huffman Codes, Aggregate Analysis
13	April 17, 2006	Graphs	Chapter 22 Graph Algorithms, Breadth-First Search, Depth-First Search
14	April 27, 2006 Unusual Day!	Graphs	Chapter 23 Spanning Trees, Kruskal's Algorithm, Prim's Algorithm
15	May 1, 2006	Graphs	Chapter 24 Shortest Paths, Bellman-Ford Algorithm, Dijkstra's Algorithm