| EECS 311: DATA STRUCTURES |
Home Course Info Links Grades |
Lectures Newsgroup Homework Exams |
| WEEK | TOPICS | READINGS | NOTES |
|---|---|---|---|
| 03/26/07 | Math and C++ Review, Algorithm Analysis | Chapters 1 and 2, Notes on Weiss, Chapter 2 (Powerpoint) |
|
| 04/02/07 | ADTS: Lists, Stacks, Queues | Chapter 3, STL Container Overview, STL Iterators STL Algorithms fixed versions of Weiss' Vector and List code |
Assignment 1 Due: 04/04/07 9am |
| 04/09/07 | Trees: AVL, Red-black, Splay, B-Trees | Chapter 4, Section 12.2 Tree overview, Balanced search tree comparison, Red-black tree notes, Notes on Weiss, Chapter 4 (Powerpoint) |
|
| 04/16/07 | Hashing | Chapter 5, Hashtable notes, Simple code using a hashtable-based map |
Assignment 2 Due: 04/18/07 9am |
| 04/23/07 | Priority Queues | Sections 6.1-4, Notes on Weiss, Chapter 6 (Powerpoint) |
Midterm: Wednesday 04/25/07 |
| 04/30/06 | Sorting | Chapter 7 (skip 7.4.1) | Friday: last day to drop courses |
| 05/07/07 | Disjoint Sets, Graphs | Chapters 8, 9 (skip 9.4) Notes on Weiss, Chapter 8 (Powerpoint), Graphs overview, Chapter 10.3.4 (Floyd's algorithm) |
Assignment 3 Due: 05/09/07 9am |
| 05/14/07 | Graphs, Dynamic Programming | Chapter 9, Chapter 10.3, Notes on Weiss, Chapter 9 (Powerpoint), Dynamic Programming Resources |
|
| 05/21/07 | Algorithm Design | Chapter 10 | |
| 05/28/07 | Wrap up and Review | Memorial Day: No class Monday | |
| 06/04/07 | Exam Week | Assignment 4 Due: Monday, 06/04/07, 9am, Final Exam: Tuesday, 9:00am-11:00am, Tech L160 |