CSC 222: Data Structures and Algorithms, Fall 2006
Schedule
This schedule is only approximate and subject to change.
| Week |
Topics |
Notes |
| 8/24 |
Course overview; Intro to Linux |
Sobell |
| 8/29-31 |
C++ Review |
Chs. 1-2 |
| 9/5-7 |
Algorithms & Containers |
Chs. 3-4 |
| 9/12-14 |
Pointers & Dynamic Memory |
Ch. 5 |
| 9/19-21 |
Lists & Iterators |
Chs. 6 & 9 |
| 9/26-28 |
Review of STL |
Exam 1 |
| 10/3-5 |
Stacks & Queues |
Chs. 7-8 |
| 10/10-12 |
Binary Trees |
Ch. 10 |
| 10/16-20 |
Fall Break |
| 10/24-26 |
Tree-Based Sets & Maps |
Chs. 11-12 |
| 10/31-11/2 |
Hash Tables |
Ch. 12 |
| 11/7-9 |
Heaps |
Ch. 14 |
| 11/14-16 |
Review of Containers |
Exam 2 |
| 11/21 |
Inheritance |
Ch. 13; Thanksgiving |
| 11/28-30 |
Graphs |
Ch. 16 |
| 12/5-7 |
Dynamic Programming |
Ch. 15 |

DePauw University,
Computer Science Department,
Fall 2006
Maintained by Brian Howard
(bhoward@depauw.edu).
Last updated