CS 5800 Fall 2009: Schedule

Created: FRI 14 Aug 2009

All readings are from Introduction to Algorithms, Third Edition Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
The second edition is OK too. The supplemental material for the third edition can be found here
http://mitpress.mit.edu/algorithms/

Note: This is an approximate schedule; it may change at any time.
Homework links will become active by the "assigned" dates.

Lectures grouped by week

1. Wed 09-09-09
• Admistrivia; overview of CS 5800; assessment
• Framework for describing and Analyzing Algorithms
• Insertion and Merge sort (Divide and Conquer)
• Order of Growth
• Reading: CLRS chapters 1, 2, 3
• Homework 1 assigned
• Ten Orders of Growth

2. Wed 09-16-09

3. Wed 09-23-09
• HeapSort, MergeSort, Divide and Conquer, QuickSort
• QuickSort Analysis, Sorting Bounds
• Reading: CLRS chapters 6 and 7
• Homework 2 due
• Homework 3 assigned

4. Wed 09-30-09
• Sorting in linear time, Median, Order statistics
• Greedy algorithms, Induction
• Reading: CLRS chapter 8, 9, 16
• Homework 3 due
• Homework 4 assigned

5. Wed 10-07-09
• Greedy algorithms, Optimal solution structure
• Dynamic programming
• Reading: CLRS chapters 16, 15
• Homework 4 due
• Homework 5 assigned

6. Wed 10-14-09
• Dynamic programming
• Homework 5 due
• Homework 6 assigned

7. Wed 10-21-09
• Hash Tables
• Review for midterm exam
• Reading: CLRS chapters 11, 9
• Homework 6 due
No late assignments accepted.

8. Wed 10-28-09 Midterm exam (in class)

9. Wed 11-04-09
• Midterm Discussion
• Amortized Analysis, Binary Search Trees
• Reading: CLRS chapters 17, 12
• Homework 7 assigned

10. Wed 11-11-09, Veterans Day, no class

11. Wed 11-18-09
• Graph representation, BFS, DFS, cycles
• DAGs, Topological sort
• Spanning trees, Kruskal, Prim
• Reading: CLRS chapters 22, 23
• Homework 7 due
• Homework 8 assigned
• Graph Algorithm Applet by Harriet Fell

12. Wed 11-25-09,Thanksgiving Break, no class

13. Wed 12-02-09
• Single source shortest path, Dijkstra
• All-pair shortest path
• Reading: CLRS chapters 24, 25
• Homework 8 due
• Homework 9 assigned

14. Wed 12-09-09
• Flows in Networks
• Homework 9 due

15. Final Exam Wed 12-16-09 6:00 PM to 9:00 PM in 173 DG

Switch to:

Harriet Fell
College of Computer Science, Northeastern University
360 Huntington Avenue #340 WVH,
Boston, MA 02115
Email: fell@ccs.neu.edu
Phone: (617) 373-2198 / Fax: (617) 373-5121
The URL for this document is: http://www.ccs.neu.edu/home/fell/CS5800/F09/scheduleF09.html