CS 600 A -- Advanced Algorithm Design and Implementation

Tuesdays from 03:30PM to 06:00PM in BC 321

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.

Pre-requisites:

CS 590.

Textbooks:

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

Instructor:

Class Mailing List:

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 3:30pm. After 3:30pm, 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++. 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 15, 2008	Introduction	Chapters 1-3, Appendix A-C Asymptotic Notation, Standard Notations, Common Functions, Summations
2	January 22, 2008	Asymptotic Analysis	Chapter 4 Recurrences
3	January 29, 2008	Sorting	Chapters 6, 7 Heaps, Heapsort, Priority Queues, Quicksort
4	February 5, 2008	Sorting	Chapters 8, 9 Lower Bounds for Sorting, Counting Sort, Radix Sort, Bucket Sort
5	February 12, 2008	Probabilistic Analysis	Chapters 5, 7 Randomized Algorithms, Randomized Quicksort
6	February 19, 2008	No class - Monday Schedule
7	February 26, 2008	MIDTERM	Comprehensive
8	March 4, 2008	Order Statistics and Hashing	Chapters 9, 11 Medians and Order Statistics, Minimum and Maximum, Hashing, Collision Resolution
9	March 11, 2008	Trees	Chapters 12, 13 Binary Search Trees, Red-Black Trees
10	March 18, 2008	No class - Spring Break
11	March 25, 2008	Dynamic Programming	Chapter 15 Dynamic Programming, Matrix-Chain Multiplication
12	April 1, 2008	Greedy Algorithms, Amortized Analysis	Chapters 16, 17 Greedy Strategy, Huffman Codes, Aggregate Analysis
13	April 8, 2008	Cancelled
14	April 15, 2008	Graphs	Chapter 22 Graph Algorithms, Breadth-First Search, Depth-First Search
15	April 22, 2008	Graphs	Chapter 23 Spanning Trees, Kruskal's Algorithm, Prim's Algorithm
16	April 29, 2008	Graphs	Chapter 24 Shortest Paths, Bellman-Ford Algorithm, Dijkstra's Algorithm
	May 6, 2008	FINAL (1-5pm, BC321)	Comprehensive