CSCI 700: Algorithms I - Design and Analysis of Algorithms

Fall 2009
Tuesday Thursday 6:30pm - 7:45pm
NSB A103
Instructor: Andrew Rosenberg (andrew_at_cs.qc.cuny.edu)
Office Hours: Thursday 5-6pm NSB A330

Students: Fill out course evaluations here.


Overview

This class will cover the fundamentals of the design and analysis of algorithms. A focus on implementation in out-of-class assignments will accompany the theoretical discussions of the material in class. Solid grasp of the design and analysis of algorithms is foundational to being a successful computer programmer and computer scientist.

Class Policy

Come to Class. It will be difficult to do well in the class without regular attendance. There is no additional penalty for missing class.

Cell phones must be on silent, and are not to be checked or used during class - if you are expecting an urgent call, tell the instructor at the start of class.

Laptops are fine for taking notes. No internet, no chat, no games.

Cell phone and Laptop policy: One warning, after that 5 points off the next homework or exam for each issue. Same policy for the instructor. One warning, after that, everyone gets 5 points on the next homework or exam.

Grading Policy

Assignments: 60% (12 x 5%)

Midterm: 15%

Final: 25%

The Final Letter Grade will be based on a scaled adjustment of the Final Numeric Grade. When the scale has been determined, the class will be informed either in class or over email, and it will be posted to the course webpage (here).

Assignment Policy

Do not cheat. You may discuss assignments with your classmates, but write or program your assignment alone. Do not ask for or offer to share code, or written assignments. If you discuss an assignment with a classmate, or on an online forum, include the name of the classmate or URL of the forum on your assignment or in the documentation of your code. The first instance of cheating results in an automatic zero for the assignment (or midterm or final). A second instance of cheating results in a zero (F) for the course. The Computer Science Department will be notified in writing of all instances of cheating. On a second instance a report will be submitted to the Office of Academic Integrity.

Assignments will be posted to the website (here) after class on Tuesdays.

All assignments will be scored out of 100 points.

There are 12 assignments. 7 are written assignments, 6 are coding assigments.

Assignments will be due just after the start of class, 6:35pm, on the following Tuesday. Written assignments should be emailed or hard-copies should be delivered in class.

Deliver assignments at the start of class or email with a timestamp before 6:35pm to avoid a late penalty. If an extension is needed let me know as soon as possible. I will do my best to be reasonable to you and fair to the rest of class. Delivering an assignment while being more than 5 minutes late for class will be make the assignment considered Late. There is a 5 point Late Penalty for each 12 hours late the assignment is delivered. Tuesday 6:35pm - Wednesday 6:35am: -5 points. Wednesday 6:36am - Wednesday 6:35pm: -10 pts. Wednesday 6:35pm - Thursday 6:35am: -15pts. Thursday 6:35am - Thursday 6:30pm: -20pts.

Grades will be posted at 6:30pm on Thursdays, just before class. After 6:30, 2 days after an assignment was due, no assignments will be accepted. Assignments that were delivered on time will be returned during Thursday classes.

After each assignment and the midterm is graded, anonymous mean, median, maximum and minimum scores will be posted to this page.

Coding Assignments

Assignments will be written in C++, and must compile using g++ on venus.cs.qc.cuny.edu with no external libraries.

In general, grading will be 15% Compilation, 15% Running, 35% Correctness (15% passing tests, 20% implementational details), 35% Documentation and Style. This may be adjusted for some assignments. Always read the assignment for the grading breakdown.

Testing will be performed automatically. Sample tests will be delivered with each assignment. If code does not operate using the published and distributed testing format, the assignment will be considered Incorrect and zero "Correctness" points will be awarded.

Detailed requirements will accompany each assignment. The instructions and requirements on a particular assignment always take precedence over the general guidelines on the course website.

Submission of coding assignments should be performed over email. Don't forget to attach your files. Submitting multiple times is fine. The latest assignment submitted on time will be graded. If you submit an assignment late, after submitting an assignment on time, you must let me know, via email, that you would like the late submission graded for the assignment.

Written Assignments

Written Assignments can be delivered electronically by email, or hard copies can be delivered by hand either in class, or dropped at my office NSB A330.

Electronic copies must be in one of the following formats: .pdf, Microsoft Word .doc, Google Docs.

Hand written copies are acceptable, but be very careful that the work is clear. If I can't read that an answer is correct, it is wrong.

Points for each question will be described in each assignment.

Exam Policy

The Midterm will be held during class on October 22nd. If you will not be able to make this date, let me know as early as possible, and I will do my best to schedule another time for you to take the Midterm.

During both the Midterm and Final exam, you will be allowed to bring a single (8.5in x 11in) sheet of paper with notes. No other material will be allowed during the exams.

The Final Exam will be cumulative, with a focus on material covered in the second half of the semester.

The Final Exam has been scheduled for Thursday, December 17th, from 6:15 to 8:15.

Text Book

Introduction to Algorithms 2nd Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. MIT Press. 2001. ISBN: 978-0070131514

This should be available through the bookstore, but may be found through other outlets at a discount.

Schedule

Date Material Assignments
Tuesday,
September 1
Introduction. Class Overview. Review of Basic Data Structures and Math. Sequential v. Binary Search [Slides] HW1 (Personal Information) Assigned
Thursday,
September 3
Asymptotic Notation. Recursion. Review of Inductive Proofs. [Slides] HW1 Due, HW2 Assigned (Written: Asymptotics and Run Time of Algorithms) [HW-2]
Tuesday,
September 8
No Class  
Thursday,
September 10
No Class  
Tuesday,
Sepember 15
Runtime of Recursive Algorithms Part I (Merge Sort, Quick Sort) [Slides] HW 2 Due, HW 3 Assigned (Code: Sorting)
[HW-3] [Sample input] [Sample output]
[Sample input (DOS)] [Sample output (DOS)]
Thursday,
September 17
Runtime of Recursive Algorithms Part II [Slides]  
Tuesday,
September 22
Linear-time Sorting - Counting Sort, Radix Sort [Slides] HW 3 Due (Written: Sorting), HW 4 Assigned [HW-4]
Thursday,
September 24
Binary Search Trees [Slides]  
Tuesday,
September 29
No Class - Monday Schedule
Thursday,
October 1
Heaps [Slides] HW 4 Due, HW 5 Assigned (Code: Heaps and Heapsort) [HW-5], HW 6 Assigned [HW-6]
Tuesday,
October 6
Some heap review. [Slides]
Operations on Streams of Data[Rescheduled] [Slides]
Thursday,
October 8
Balanced Binary Search Trees Part I[Slides]
Tuesday,
October 13
Balanced Binary Search Trees Part II[Slides] HW5 Due
Thursday,
October 15
Operations on Streams of Data [Slides]  
Tuesday,
October 20
Midterm Review [Slides] HW 6 Due
Thursday,
October 22
Midterm Exam  
Tuesday,
October 27
Dynamic Programming [Slides] HW 7 Assigned (Code: Dynamic Programming) [HW-7]
Thursday,
October 29
Greedy Algorithms [Slides]  
Tuesday,
November 3
Huffman Coding [Slides]  
Thursday,
November 5
Optimization Slack and Review. [Slides] HW 8 Assigned (Written: Optimization) [HW-8]
Tuesday,
November 10
Introduction to Graphs. [Slides] HW 7 Due
Thursday,
November 12
Graph Algorithms: Breadth-first-search. Depth-first-search. [Slides] HW 8 Due, HW 9 Assigned (Written: Graph DFS, BFS, Dijkstra's Algorithm) [HW-9]
Tuesday,
November 17
Dijkstra's Algorithm. Strongly Connected Components. Minimum Spanning Trees. Prim's Algorithm. [Slides]  
Thursday,
November 19
Strongly Connected Components. Prim's Algorithm. [Slides]  
Tuesday,
November 24
Kruskal's Algorithm. Shortest Paths with Matrix Multiplication [Slides] HW 9 Due, HW 10 Assigned (Written: Graph Distances) [HW-10]
Thursday,
November 26
No Class - Thanksgiving  
Tuesday,
December 1
Bellman-Ford. [Slides] HW 10 Due, HW 11 Assigned (Code: Graph Distances) [HW-11]
Thursday,
December 3
Hashing [Slides]
Tuesday,
December 8
NP-Completeness [Slides]
Thursday,
December 10
Final Review [Slides]

Note: the final covers any material covered in class and homework unless explicitly noted otherwise. This includes material not explicitly covered in these review slides.
HW 11 Due
Thursday,
December 17
Final Exam - 6:15pm-8:15pm in NSB A103