Calendar of Topics (Tentative)
University Schedule
important dates of this course
All assignments (homework) can be downloaded at Assignments section
Meeting Time: TTH 2:00PM-3:15PM
Calendar of Topics (Tentative)
The following topics are being constantly updated.........
| Week | Topics | |
|---|---|---|
| Week 1 8/20 | Overview of Data structure and algorithms | |
| Week 2 8/25 | Data structures | |
| Assignment 1 (Due 9/10/2008) | ||
| 8/27 | analysis framework Chapter2 | |
| Week 3 9/01 | Ch2.2 Ch 2.3 | |
| 9/03 | Ch2.4 Ch 2.5 | |
| Week 4 9/08 | Ch2.6 Ch 2.7 | |
| Assignment 2 (Due 9/24/2008) | ||
| 9/10 | ch3 Brute force algorithms | |
| Week 5 9/15 | ch4 divide and conquer | |
| 9/17 | ch4 divide and conquer | |
| Week 6 9/22 | ch4 divide and conquer | |
| Assignment 3 (Due 10/13/2008) | ||
| 9/24 | +review | |
| Week 7 9/29 | Midterm Exam1 | |
| 10/01 | Discussion of Midterm1 | |
| Week 8 10/06 | Divide and conquer algorithms | |
| 10/08 | No class | |
| Week 9 10/13 | Decrease and conquer | |
| 10/15 | Decrease and Conquer: DFS | |
| Assignment 4 (Due 10/27/2008) | ||
| Week 10 10/20 | Decrease and Conquer: BFS,Topological Sorting, binary search tree | |
| 10/22 | Transform and conquer Ch6 | |
| Week 11 10/27 | Transform and conquer AVL Tree, Heapsort | |
| Assignment 5 (Due 11/05/2008) | ||
| 10/29 | Midterm Exam2 | |
| Week 12 11/03 | No class | |
| Assignment 6 (Due 11/19/2008) | ||
| 11/05 | Space time tradeoff Ch7 | |
| Week 13 11/10 | Dynamic programming Ch8 | |
| 11/12 | Greedy Algorithm Ch9 | |
| Week 14 11/17 | Greedy algorithm: Dijkstra algo, Huffman tree | |
| Assignment 7 (Due 12/04/2008) | ||
| 11/19 | Limitation of algorithm power. Ch10 | |
| Week 15 11/24 | Limitation of algorithm power | |
| 11/26 | No class. Thanksgiving | |
| Week 16 12/01 | Coping with algorithm limit Ch11 | |
| 12/03 | Review for final | |
| Week 17 12/09 | Final Exam Wednesday, 2:00 p.m. |