CSCI 271
Tentative READING SCHEDULE
| Week | Dates |
Topic | Reading |
| 1 | Jan. 12 | Intro, Math Review, C++ Review | Chapter 1, 2 |
| 2 | Jan. 19 | Lists, Stacks, Queues | Chapter 4 |
| 3 | Jan. 26 | Algorithm Analysis | Chapter 3 |
| 4 | Feb. 2 | Binary Trees | Chapter 5 |
| 5 | Feb. 9 | Binary Trees, Test 1, General Trees | Chapter 6 |
| 6 | Feb.16 | General Trees | Chapter 6 |
| 7 | Feb. 23 | Sorting | Chapter 7 |
| 8 | March 2 | Sorting, Searching | Chapter 7, 9 |
| 9 | March 9 | Searching, Test 2 | Chapter 9 |
| 10 | March 16 | Spring Break | |
| 11 | March 23 | File Processing | Chapter 8 |
| 12 | March 30 | Graphs | Chapter 11 |
| 13 | April 6 | Graphs, Test 3 | Chapter 11 |
| 14 | April 13 | Computational Limits | Chapter 15 |
| 15 | April 20 | Indexing | Chapter 10 |
| 16 | April 27 | Summary | none |