CS 600 Advanced Algorithm Design and Implementation

Your first resource for help with assignments is your textbook and then the instructor, in that order.

When submitting a programming problem, use the Unix script command (e.g. see here) to record your input/output. Steps:
0. Start script 1. List (cat) your program 2. Compile your program, showing no compile errors 3. Do your test runs 4. Close script.
Include this script in your tar or ZIP file containing all program files.

There will be homework assignments (20%), up to four unannounced quizzes (30%), a midterm exam (25%), and a final exam (25%).

Cell phones should be on silent during the class. Cell phone use is not permitted during class.
Laptops, netbooks, or similar devices should not be used in class, unless explicitly required.
Any audio/video recording of the lectures is prohibited.
All homeworks, exams and quizzes are pledged (undergraduates).
All homeworks and assignments must compile and run on the CS lab machines, except when specified otherwise. Failure to run on those machines will result in a zero grade.
There will be no make-up quizzes.
A make-up exam 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.
If you need counseling, please visit http://www.stevens.edu/counseling/
No late homeworks. Homeworks are due by the specified deadline. They should be mailed, with a subject line containing the course number (CS 600), to the instructor by beginning of class (PDF format for text, ZIP or tar files for programming exercises).
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 projects 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. Assignments may be sent through a plagiarism checker (such as TurnItIn).
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. Self-plagiarism counts as cheating as well.
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 respective School.

Lectures:

You are responsible for material presented in lectures, including oral comments made by the lecturer.

This is the outline we will try to follow:

Date	Topics Covered	Reading	Assignments
Sep 2, 2009	Analysis of Algorithms, Insertion Sort, Mergesort	Chapters 1-2
Sep 9, 2009	Asymptotic Notation, Recurrences, Substitution, Master Method	Chapters 3-4
Sep 16, 2009	Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication	Sections 28.2 and 30.1	Do: Exercises 2.2-1, 2.2-2. 2.3-3. Submit: Problems 2-1, 2-4 Do: Exercises 3.1-1, 3.1-2, 3-1.3, 3-1.4, 3-1.7, 3-1.8. 3.2-1, 3.2-2 Submit: Problem 3-3
Sep 23, 2009	Quicksort, randomized algorithms	Sections 5.1-5.3 Chapter 7	Submit: Exercise 2.3-5 (but: write real C code for both iterative and recursive approaches, implement the three parameter passing methods from Problem 4-3 for the recursive version, do a test run with n = 10, 100, 1000, 10000, 100000, 1000000, time your results, include the script file as described above, and your conclusions about the respective running times for all 4 versions) Do: Exercises 3.2-6, 4.1-1, 4.1-2, 4.1-6, 4.2-2, 4.2-3 Submit: Problems 4-1, 4-4
Sep 30, 2009	NO CLASS TODAY. Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort	Sections 8.1-8.3
Oct 7, 2009	Order Statistics, Medians		Do: Problem 4-5, Exercises 5.2-3, 7.1-1 Submit: Exercise 5.2-4, Problems 5-1, 7-4
Oct 14, 2009	Applications of Median, Bucketsort	Sections 9.1-9.3	Do: Exercises 8.2-1, 8.3-1 Submit: Problem 8-3
Oct 21, 2009	Binary Search Trees, Red Black Trees - MIDTERM	Chapters 12-13
Oct 28, 2009	Dynamic programming	Chapter 15
Nov 4, 2009	Greedy algorithms, minimum spanning trees	Chapter 16	Do: Exercises 9.1-1, 9.2-1, 9.3-1, 9.3-9 Submit: Problem 9.1 (a and c only) Do: Exercise 11.2-1, 11.2-2 Submit: Exercise 11.4-3
Nov 11, 2009	Graph searching, BFS, DFS	Chapters 22-23	Do: Exercises 12.3-1 (in C), 12.3-3 (in C), 13.3-3 Submit: Problem 13-1 (also include C code for part b, for all required functions).
Nov 18, 2009	Shortest Paths: Bellman Ford, Dijkstra's algorithms.	Chapter 24	Submit: 23-1 (a, b only)
Dec 2, 2009	Shortest paths II: all-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson	Chapter 25	Submit: Problem: You are a market trader dealing in international currencies. A colleague of yours, the smug programmer, has just been laid off. You are seeking a way to make money fast for your trading company, and have considered arbitrage, a technique described in Problem 24-3. Answer 24-3 a) and b), and add: c) implement it in C using sample data, e.g. from http://finance.yahoo.com/currency-investing#cross-rates or http://www.xe.com/ucc/
Dec 16, 2009	FINAL EXAM

CS 600 - Advanced Algorithm Design and Implementation

W 6:15pm-8:45pm - BC 219