Last modified:

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

- 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

- Wed 09-16-09
- Math primer, Recurrences
*Reading: CLRS Appendix A, chapter 4***Homework 1 due**- Homework 2 assigned
- Solving Recurrences via Iteration
- Simplified Master Method

- 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

- 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

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

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

- Wed 10-21-09
- Hash Tables
- Review for midterm exam
*Reading: CLRS chapters 11, 9***Homework 6 due**

No late assignments accepted.

- Wed 10-28-09
**Midterm exam**(in class) - Wed 11-04-09
- Midterm Discussion
- Amortized Analysis, Binary Search Trees
*Reading: CLRS chapters 17, 12*- Homework 7 assigned

- Wed 11-11-09,
**Veterans Day**, no class - 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

- Wed 11-25-09,
**Thanksgiving Break**, no class - Wed 12-02-09
- Single source shortest path, Dijkstra
- All-pair shortest path
*Reading: CLRS chapters 24, 25***Homework 8 due**- Homework 9 assigned

- Wed 12-09-09
- Flows in Networks
*Reading: CLRS chapters 26***Homework 9 due**

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

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