Textbook is be avaiable be at the Campus Store.
This book is new, and seems to have many errors. We will be maintaining a list of errors in the book. Please keep watch on this page, as it will probably change over the course of the semester.
Additionally, if you find typos (no matter how minor), please email them to Amit Kumar, as we will be sending them to the publisher at the end of the semester.
We have an additional supplemental course packet. Course packets
are available in the Campus store.
Another useful reference book is:
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction
to Algorithms. McGraw Hill, 1990.
| Date | Topic | Assignment due |
|---|---|---|
| Aug. 28 Sept 2 | Connectivity | |
| Sept. 4 | Arrays and Linked Lists | |
| Sept. 9-18 | Sorting | W1 due Sept 9; P1 due Sept 18, |
| Sept. 23-Oct 2 | Hashing | W2 due Sept 25 |
| Oct. 7 | Heaps | P2 due Oct 7 |
| Oct 9 | Prelim I | |
| Oct. 14 | Fall Break | |
| Oct. 16-30 | BST | W3 due Oct 23 |
| Nov. 4 | Radix Search | P3 due Nov. 4 |
| Nov. 6 | Prelim 2 | |
| Nov. 11-13 | Lempel-Ziv | |
| Nov. 18- 25 | Graph alg's | P4 due Nov 20 |
| Nov. 27 | Thanksgiving Break | |
| Dec. 2- 4 | Graph alg's | W4 due Dec. 4 |
| Dec. 11 | Final |